Comments on Flow shop and open shop scheduling with a critical machine and two operations per job

DOI10.1016/S0377-2217(03)00236-4zbMath1106.90332MaRDI QIDQ1877042

Uri Yovel, Gur Mosheiov

Publication date: 16 August 2004

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

zbMATH Keywords

SchedulingFlow-shopPolynomial time algorithmMinimum makespan

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Survey and extensions of manufacturing models in two-stage flexible flow shops with dedicated machines ⋮ A heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ The optimal number of used machines in a two-stage flexible flowshop scheduling problem ⋮ Batch scheduling in a two-stage flexible flow shop problem ⋮ Total completion time minimization in a \(2\)-stage differentiation flowshop with fixed sequences per job type ⋮ A two-stage flow shop scheduling with a critical machine and batch availability ⋮ Scheduling of a two-stage differentiation flowshop to minimize weighted sum of machine completion times ⋮ Proportionate flow shop: New complexity results and models with due date assignment

Cites Work

• Flow shop and open shop scheduling with a critical machine and two operations per job
• Optimal two- and three-stage production schedules with setup times included

This page was built for publication: Comments on Flow shop and open shop scheduling with a critical machine and two operations per job