arrow
返回

An energy-efficient permutation flowshop scheduling problem

delete2020-07-01
delete43
PRE
AI
H
Hande Öztop
M
M. Fatih Tasgetiren *
D
Deniz Türsel Eliiyi
潘全科 (Quan-Ke Pan)
L
Levent Kandiller
DOI:10.1016/j.eswa.2020.113279delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The permutation flowshop scheduling problem (PFSP) has been extensively explored in scheduling literature because it has many real-world industrial implementations. In some studies, multiple objectives related to production efficiency have been considered simultaneously. However, studies that consider energy consumption and environmental impacts are very rare in a multi-objective setting. In this work, we studied two contradictory objectives, namely, total flowtime and total energy consumption (TEC) in a green permutation flowshop environment, in which the machines can be operated at varying speed levels corresponding to different energy consumption values. A bi-objective mixed-integer programming model formulation was developed for the problem using a speed-scaling framework. To address the conflicting objectives of minimizing TEC and total flowtime, the augmented epsilon-constraint approach was employed to obtain Pareto-optimal solutions. We obtained near approximations for the Pareto-optimal frontiers of small-scale problems using a very small epsilon level. Furthermore, the mathematical model was run with a time limit to find sets of non-dominated solutions for large instances. As the problem was NP-hard, two effective multi-objective iterated greedy algorithms and a multi-objective variable block insertion heuristic were also proposed for the problem as well as a novel construction heuristic for initial solution generation. The performance of the developed heuristic algorithms was assessed on well-known benchmark problems in terms of various quality measures. Initially, the performance of the algorithms was evaluated on small-scale instances using Pareto-optimal solutions. Then, it was shown that the developed algorithms are tremendously effective for solving large instances in comparison to time-limited model. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Permutation flowshop scheduling problem
Multi-objective optimization
Energy-efficient scheduling
Heuristic algorithms
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
2.9W
被引数:
10.2W

机构

I
izmir university of bakircay
学者数:
445
论文数: 389
被引数: 0
Y
Yasar University
学者数:
386
论文数: 572
被引数: 2
Q
Qatar University
学者数:
8.9K
论文数: 9.0K
被引数: 16
S
shanghai university
学者数:
3.9W
论文数: 2.7W
被引数: 52
学者 查看更多机构
引用论文

引用论文

Progressive Vision Loss
err1992-02-01
err0
PREAI
errSudhir Malik
err分享
err收藏
err分享
err收藏
Metaheuristic algorithms for the hybrid flowshop scheduling problem
err2019-11-01
err69
PREAI
errOztop, Hande; Tasgetiren, M. Fatih; Eliiyi, Deniz Tursel; Pan, Quan-Ke
err分享
err收藏
学者 查看更多内容