Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage |
| |
| Authors: | Jian-ming Dong Jue-liang Hu Yong Chen |
| |
| Affiliation: | 1. Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou, 310018, China
2. Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou, 310018, China
|
| |
| Abstract: | This paper considers a scheduling problem in two-stage hybrid flow shop, where the first stage consists of two machines formed an open shop and the other stage has only one machine. The objective is to minimize the makespan, i.e., the maximum completion time of all jobs. We first show the problem is NP-hard in the strong sense, then we present two heuristics to solve the problem. Computational experiments show that the combined algorithm of the two heuristics performs well on randomly generated problem instances. |
| |
| Keywords: | hybrid flow shop open shop Heuristic algorithm. |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
|
