A Bi-objective Model for a Flowshop Scheduling Problem with Availability Constraint of Machines | ||
| Advances in Industrial Engineering | ||
| مقاله 5، دوره 48، شماره 2، 2014، صفحه 189-200 اصل مقاله (746.69 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22059/jieng.2014.52913 | ||
| نویسندگان | ||
| Mohammad Rezaei Malek؛ Reza Tavakkoli Moghaddam* ؛ Farshid Evaz Abadian | ||
| چکیده | ||
| This paper presents a new bi-objective mathematical model for a permutation flowshop scheduling problem with availability constraint in case of preventive maintenance operations on machines. In this paper, preventive maintenance is flexible and there is not a certain time for the maintenance operation; however, time between two consecutive maintenance operations for each machine should not be greater than a given time. The model has two objectives; (1) minimizing the makespan (i.e., Cmax) and, (2) minimizing the sum of earliness and tardiness simultaneously. This study reports the results obtained by the Reservation Level Tchebycheff Procedure (RLTP) and the ε-constraint method for solving a case study problem. The results show high quality of reached solutions from RLTP in comparison with the ε-constraint method. | ||
| کلیدواژهها | ||
| Permutation flowshop scheduling؛ Preventive maintenance؛ Earliness and tardiness؛ Cmax؛ Bi-objective optimization | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 3,679 تعداد دریافت فایل اصل مقاله: 3,940 |
||