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

DOI10.1016/J.EJOR.2006.07.023zbMath1128.90028OpenAlexW2020310393MaRDI QIDQ879285

Jeffrey D. Laub, John W. Fowler, Ahmet Burak Keha

Publication date: 11 May 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.07.023

zbMATH Keywords

schedulingflowshopsemiconductor manufacturingmultiple-orders-per-job

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures ⋮ A genetic algorithm based approach for scheduling of jobs containing multiple orders in a three-machine flowshop ⋮ Batch-size-based rearrangement of the shop floor into mini-lines ⋮ Hybrid algorithms for the earliness–tardiness single-machine multiple orders per job scheduling problem with a common due date ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ Scheduling multiple orders per job in a single machine to minimize total completion time ⋮ Grouping genetic algorithms for solving single machine multiple orders per job scheduling problems

Cites Work

• Unnamed Item
• Flow shop scheduling with lot streaming
• Scheduling with batching: A review
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• The Batch Loading and Scheduling Problem
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Scheduling a single batch processing machine with non-identical job sizes

This page was built for publication: Minimizing makespan with multiple-orders-per-job in a two-machine flowshop