Green permutation flowshop scheduling problem with sequence-dependent setup times: a case study

Increasing global energy consumption, large variations in its cost and the environmental degradation effects are good reasons for the manufacturing industries to become greener. Green shop floor scheduling is increasingly becoming a vital factor in the sustainable manufacturing. In this paper, a gre...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of production research Ročník 57; číslo 10; s. 3311 - 3333
Hlavní autoři: Ramezanian, Reza, Vali-Siar, Mohammad Mahdi, Jalalian, Mahdi
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Taylor & Francis 19.05.2019
Taylor & Francis LLC
Témata:
Algorithms
Case depth
constructive heuristic
Energy conservation
Energy consumption
Energy measurement
flowshop scheduling
Greedy algorithms
green manufacturing; energy consumption
Heuristic
Heuristic methods
Integer programming
Job shops
Linear programming
Optimization
Permutations
Production scheduling
Scheduling
sequence-dependent setup times
Sequential scheduling
Setup times
Sustainability
Sustainable development
ISSN:0020-7543, 1366-588X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Increasing global energy consumption, large variations in its cost and the environmental degradation effects are good reasons for the manufacturing industries to become greener. Green shop floor scheduling is increasingly becoming a vital factor in the sustainable manufacturing. In this paper, a green permutation flowshop scheduling problem with sequence-dependent setup times is studied. Two objectives are considered including minimisation of makespan as a measure of service level and minimisation of total energy consumption as a measure of environmental sustainability. We extend a bi-objective mixed-integer linear programming model to formulate the stated problem. We develop a constructive heuristic algorithm to solve the model. The constructive heuristic algorithm includes iterated greedy (CHIG) and local search (CHLS) algorithms. We develop an efficient energy-saving method which decreases energy consumption, on average, by about 15%. To evaluate the effectiveness of the constructive heuristic algorithm, we compare it with the famous augmented ϵ-constraint method using various small-sized and large-sized problems. The results confirm that the heuristic algorithm obtains high-quality non-dominated solutions in comparison with the augmented ϵ-constraint method. Also, they show that the CHIG outperforms the CHLS. Finally, this paper follows a case-study, with in-depth analysis of the model and the constructive heuristic algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2019.1581955