A bicriteria m-machine flowshop scheduling with sequence-dependent setup times

作者：Eren Tamer^*

来源：Applied Mathematical Modelling, 2010, 34(2): 284-293.

DOI：10.1016/j.apm.2009.04.005

• m-Machine flowshop scheduling
• Bicriteria
• Sequence-dependent setup times
• Integer programming model
• Heuristic methods

In this study, a bicriteria m-machine flowshop scheduling with sequence-dependent setup times is considered. The objective function of the problem is minimization of the weighted sum of total completion time and makespan. Only small size problems with up to 6 machines and 18 jobs can be solved by the proposed integer programming model. Also the model is tested on an example. We also proposed three heuristic approaches for solving large jobs problems. To solve the large sizes problems up to 100 jobs and 10 machines, special heuristics methods is used. Results of computational tests show that the proposed model is effective in solving problems.

• 出版日期2010-2