Flexible flow shop scheduling with uniform parallel machines |
| |
| Affiliation: | 1. School of Computer Science, Liaocheng University, Liaocheng 252000, China;2. Macau Institute of Systems Engineering, Macau University of Science and Technology, Taipa 999078, Macao;3. Department of Industrial Engineering, School of Intelligent Systems Science and Engineering, Jinan University, Zhuhai 519070, China;4. State Key Lab of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan 430074, China |
| |
| Abstract: | We consider the multistage flexible flow shop scheduling problem with uniform parallel machines in each stage and the objective of minimizing makespan. We develop a general class of heuristics for this strongly NP-hard problem that extend several well-known heuristics for the corresponding embedded serial flow shop problem, and obtain absolute performance guarantees for heuristics in this class by building on similar absolute performance guarantees for the corresponding serial flow shop heuristics. Our approach is quite robust, since it can extend any heuristic for the serial flow shop problem (with an absolute performance guarantee) to a similar one for the flexible flow shop problem with uniform parallel machines. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
