Scheduling two-machine no-wait open shops to minimize makespan

DOI10.1016/j.cor.2003.09.005zbMath1071.90018OpenAlexW1990517659MaRDI QIDQ707009

Ching-Fang Liaw, Chun-Yuan Cheng, Ming-Chih Chen

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.005

zbMATH Keywords

SchedulingOpen shopBranch-and-boundHeuristicNo-wait

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

The two-machine no-wait general and proportionate open shop makespan problem ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ Model formulations for the machine scheduling problem with limited waiting time constraints

Cites Work

• Unnamed Item
• Unnamed Item
• No-wait shop scheduling: Computational complexity and approximate algorithms
• NP-complete scheduling problems
• New heuristics for no-wait flowshops to minimize makespan.
• Optimal scheduling for two-processor systems
• Algorithms for the Assignment and Transportation Problems
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Complexity of Scheduling Shops with No Wait in Process
• Unit Execution Time Shop Problems
• Open shop problems with unit time operations
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• Solution of the Flowshop-Scheduling Problem with No Intermediate Queues
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Scheduling two-machine no-wait open shops to minimize makespan