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

DOI10.1016/J.EJOR.2006.07.023zbMATH Open1128.90028OpenAlexW2020310393MaRDI QIDQ879285FDOQ879285

Authors: Jeffrey D. Laub, John Fowler, Ahmet 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

Recommendations

• A flowshop scheduling problem with two operations per job
• New heuristics for flow shop problem to minimize makespan
• On the Minimization of the Makespan Subject to Flowtime Optimality
• The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
• Minimizing makespan in a two-machine flowshop scheduling with batching and release time

zbMATH Keywords

schedulingsemiconductor manufacturingflowshopmultiple-orders-per-job

Mathematics Subject Classification ID

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

Cites Work

• Scheduling with batching: A review
• Title not available (Why is that?)
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Scheduling a single batch processing machine with non-identical job sizes
• The Batch Loading and Scheduling Problem
• Flow shop scheduling with lot streaming
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879285)