An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines |
| |
Authors: | Deming Lei Tao Wang |
| |
Affiliation: | School of Automation, Wuhan University of Technology, China |
| |
Abstract: | This paper considers scheduling problem of flow shop with many batch processing machines and objective of maximum lateness. An effective neighborhood search algorithm (NSA) is proposed for the problem, in which a job permutation and a batch permutation are used to indicate the solution of two sub-problems, respectively. Each job permutation consists of several family-permutations for the representation of jobs from the same family. Two swaps are applied to two permutations to produce new solutions. NSA is applied to a number of instances and compared with some methods, and computational results validate the good performance of NSA. |
| |
Keywords: | Neighborhood search Flow shop scheduling Batch processing machines Permutation |
本文献已被 ScienceDirect 等数据库收录! |