Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1706694 | Applied Mathematical Modelling | 2010 | 10 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Tamer Eren,