|
|||||
|
|
New block properties for flowshop scheduling with blocking and their application in an iterated greedy algorithm |
|
| Authors: | Jian-Ya Ding Jatinder ND Gupta Cheng Wang Rui Zhang Cheng Wu |
| Affiliation: | 1. Department of Automation, Tsinghua University, Beijing, P.R. China.;2. College of Business Administration, University of Alabama in Huntsville, Huntsville, AL, USA.;3. School of Economics and Management, Nanchang University, Nanchang, P.R. China. |
| Abstract: | This paper proposes new block properties for the flowshop scheduling problem with blocking to minimise makespan. A pruning procedure based on these proposed properties is used in the construction phase of an iterated greedy algorithm to decrease the total number of solutions to be examined to find an optimal schedule. Computational results using Taillard’s benchmark problem instances show that the new block properties help to eliminate more ‘unpromising’ solutions than the classic properties. In addition, the effectiveness of the proposed algorithm is verified by comparison with some high-performing algorithms for the considered problem. |
| Keywords: | scheduling flowshop with blocking block properties pruning procedure iterated greedy algorithm |