A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop

作者：Liu Cheng Hsiang^*

来源：International Journal of Production Research, 2010, 48(15): 4379-4396.

DOI：10.1080/00207540902933163

• multiple orders per job
• genetic algorithm
• scheduling
• total weighted tardiness
• wafer fabrication

This paper investigates a new scheduling problem of multiple orders per job (MOJ) in a three-machine flowshop consisting of an item-processing machine, a lot-processing machine and a batch-processing machine, for a semiconductor manufacturing operation that must form a layer on the wafers. The three-machine flowshop MOJ scheduling problem deals with sequencing customer orders, assigning orders to jobs, and then combining the formed jobs into batches. Genetic algorithms are presented for this scheduling problem to minimise the total weighted tardiness (TWT), in the presence of non-zero order ready times, different order due dates, different order weights and unequal order sizes. Extensive experiments were performed to compare the proposed genetic algorithm (GA)-based approach with the benchmark heuristics presented in previous studies. The experiments led to the conclusions that the GA-based approach is significantly superior over other heuristics in terms of TWT and can find near-optimal solutions in an acceptable amount of computation time.

• 出版日期2010