Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes

• Published in: International journal of systems science Vol. 45; no. 3; pp. 571 - 578
• Main Authors: Cheng, Bayi, Yang, Shanlin, Hu, Xiaoxuan, Li, Kai
• Format: Journal Article
• Language: English
• Published: Taylor & Francis Group 01.03.2014
• Subjects: Algorithms; arbitrary job sizes; batch-processing machines; flow shop; heuristics; Interruption; Machine shops; Mathematical models; Optimization; Polynomials; Running; Scheduling
• ISSN: 0020-7721; 1464-5319
• DOI: 10.1080/00207721.2012.724107

This article considers the problem of scheduling two batch-processing machines in flow shop where the jobs have arbitrary sizes and the machines have limited capacity. The jobs are processed in batches and the total size of jobs in each batch cannot exceed the machine capacity. Once a batch is being processed, no interruption is allowed until all the jobs in it are completed. The problem of minimising makespan is NP-hard in the strong sense. First, we present a mathematical model of the problem using integer programme. We show the scale of feasible solutions of the problem and provide optimality properties. Then, we propose a polynomial time algorithm with running time in O(nlogn). The jobs are first assigned in feasible batches and then scheduled on machines. For the general case, we prove that the proposed algorithm has a performance guarantee of 4. For the special case where the processing times of each job on the two machines satisfy p 1 j  = ap 2 j , the performance guarantee is for a > 0.