Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

S. H. Chung, Y. T. Tai, W.l. Pearn

Research output: Contribution to journalArticlepeer-review

58 Scopus citations

Abstract

This paper considers the parallel batch processing machine scheduling problem which involves the constraints of unequal ready times, non-identical job sizes, and batch dependent processing times in order to sequence batches on identical parallel batch processing machines with capacity restrictions. This scheduling problem is a practical generalisation of the classical parallel batch processing machine scheduling problem, which has many real-world applications, particularly, in the aging test operation of the module assembly stage in the manufacture of thin film transistor liquid crystal displays (TFT-LCD). The objective of this paper is to seek a schedule with a minimum total completion time for the parallel batch processing machine scheduling problem. A mixed integer linear programming (MILP) model is proposed to optimise the scheduling problem. In addition, to solve the MILP model more efficiently, an effective compound algorithm is proposed to determine the number of batches and to apply this number as one parameter in the MILP model in order to reduce the complexity of the problem. Finally, three efficient heuristic algorithms for solving the large-scale parallel batch processing machine scheduling problem are also provided.

Original languageEnglish
Pages (from-to)5109-5128
Number of pages20
JournalInternational Journal of Production Research
Volume47
Issue number18
DOIs
StatePublished - 1 Jan 2009

Keywords

  • Parallel batch; scheduling; unequal ready time

Fingerprint Dive into the research topics of 'Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes'. Together they form a unique fingerprint.

Cite this