On non-permutation solutions to some two machine flow shop scheduling problems

DOI10.1007/BF01435460zbMath0842.90066OpenAlexW1980745353MaRDI QIDQ4300604

C. M. Zwaneveld, Vitaly A. Strusevich

Publication date: 15 August 1994

Published in: [https://portal.mardi4nfdi.de/entity/Q4300601 ZOR Zeitschrift f�r Operations Research Mathematical Methods of Opeartions Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01435460

zbMATH Keywords

NP-hardpermutation scheduletwo machine flow shop schedulingfinite storage capacity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine ⋮ Two-stage no-wait scheduling models with setup and removal times separated ⋮ Minimizing functions of infeasibilities in a two-machine flow shop ⋮ A heuristic for the two-machine open-shop scheduling problem with transportation times ⋮ Two-machine group scheduling problem with blocking and anticipatory setups

Cites Work

• Two machine open shop scheduling problem with setup, processing and removal times separated
• Optimal two- and three-stage production schedules with setup times included
• Sequency on two and three machines with setup, processing and removal times separated
• Flowshop scheduling with limited temporary storage
• The Complexity of Flowshop and Jobshop Scheduling
• Sequencing n jobs on two machines with setup, processing and removal times separated
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: On non-permutation solutions to some two machine flow shop scheduling problems