Two-machine flow shop scheduling problems with no-wait jobs

DOI10.1016/J.ORL.2004.06.003zbMath1140.90391OpenAlexW1982374103MaRDI QIDQ1779704

Jean-Louis Bouquard, Vitaly A. Strusevich, Jean-Charles Billaut, Mikhail A. Kubzin

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.06.003

zbMATH Keywords

ComplexityApproximationFlow shopNo-wait

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ A survey of scheduling problems with no-wait in process ⋮ Model formulations for the machine scheduling problem with limited waiting time constraints ⋮ SCHEDULING TWO-MACHINE FLOW SHOPS WITH EXACT DELAYS

Cites Work

• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Optimal two- and three-stage production schedules with setup times included
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Unnamed Item

This page was built for publication: Two-machine flow shop scheduling problems with no-wait jobs