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

DOI10.1016/J.EJOR.2006.07.023MaRDI QIDQ879285zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Flow shop scheduling with lot streaming
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling with batching: A review
• The Batch Loading and Scheduling Problem

Cited in

(12)

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

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)