Minimising makespan on a single batch processing machine with dynamic job arrivals and non-identical job sizes

作者：Zhou Shengchao; Chen Huaping; Xu Rui^*; Li Xueping

来源：International Journal of Production Research, 2014, 52(8): 2258-2274.

DOI：10.1080/00207543.2013.854937

• batch processing machine
• scheduling
• makespan
• heuristics

Batch scheduling is a prevalent policy in many industries such as burn-in operations in semiconductor manufacturing and heat treatment operations in metalworking. In this paper, we consider the problem of minimising makespan on a single batch processing machine in the presence of dynamic job arrivals and non-identical job sizes. The problem under study is NP-hard. Consequently, we develop a number of efficient construction heuristics. The performance of the proposed heuristics is evaluated by comparing their results to two lower bounds, and other solution approaches published in the literature, namely the first-fit longest processing time-earliest release time (FFLPT-ERT) heuristic, hybrid genetic algorithm (HGA), joint genetic algorithm and dynamic programming (GA+DP) approach and ant colony optimisation (ACO) algorithm. The computational experiments demonstrate the superiority of the proposed heuristics with respect to solution quality, especially for the problems with small size jobs. Moreover, the computational costs of the proposed heuristics are very low.

• 出版日期2014-4-18
• 单位中国科学技术大学