Neighborhood search for minimizing tardiness objectives on flow shop of batch processing machines
This paper presents the scheduling problem on flow shop with batch processing machines (BPM) to minimize maximum tardiness. An efficient neighborhood search is proposed for the problem, in which job permutation and batch permutation are optimization object and the solution of two sub-problems can be directly obtained by using the permutations. To obtain the promising results, an initial solution of neighborhood search is first produced and then two swap operations are applied to improve the solution. The proposed neighborhood search is finally tested and the computational results show its good performance on many-BPM flow shop scheduling.
neighborhood search flow shop batch processing machine maximum tardiness
Tao Wang Deming Lei Qiongfang Zhang Wen Chen
School of Automation, Wuhan University of Technology, 122 Luoshi Road, Wuhan, Hubei Province, Peoples Republic of China
国际会议
太原
英文
512-516
2010-10-22（万方平台首次上网日期，不代表论文的发表时间）