Minimizing makespan with multiple-orders-per-job in a two-machine flowshop

• Published in: European journal of operational research Vol. 182; no. 1; pp. 63 - 79
• Main Authors: Laub, Jeffrey D., Fowler, John W., Keha, Ahmet B.
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01-10-2007; Elsevier; Elsevier Sequoia S.A
• Series: European Journal of Operational Research
• Subjects: Applied sciences; Exact sciences and technology; Flowshop; Heuristic; Inventory control, production control. Distribution; Job orders; Job shops; Multiple criteria decision making; Multiple-orders-per-job; Operational research and scientific management; Operational research. Management science; Production scheduling; Scheduling; Scheduling, sequencing; Semiconductor manufacturing; Semiconductors; Studies; Scheduling; Flowshop; Semiconductor manufacturing; Multiple-orders-per-job; Performance evaluation; Lower bound; Order picking; Makespan; Modeling; Optimization; Production management; Microelectronic fabrication; Heuristic method; Flow shop; Sequencing
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2006.07.023

We investigate a new scheduling problem, multiple-orders-per-job (MOJ), in the context of a two-machine flowshop. Lower bounds for the makespan performance measure are provided for combinations of lot-processing and item-processing machines. An optimization model is presented that addresses both job formation and job sequencing. We define a heuristic to minimize the makespan for the MOJ problem for two-machine item-processing flowshops. The heuristic obtains solutions within 2% of a tight lower bound and runs in
O(
HF) time, where
H is the number of orders and
F is the restricted number of jobs.