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

DOI10.1016/J.COR.2003.09.005MaRDI QIDQ707009zbMATH OpenOpenAlexFDO

Authors 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

Branch-and-boundHeuristicNo-waitOpen shopScheduling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1279216
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
• Scheduling two-machine preemptive open shops to minimize total completion time
• Two-machine open shop scheduling with special transportation times
• The two-machine no-wait general and proportionate open shop makespan problem

Cites work

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

Cited in

(13)

• A survey of scheduling problems with no-wait in process
• Scheduling two-machine preemptive open shops to minimize total completion time
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Scheduling the two-machine open shop problem under resource constraints for setting the jobs
• An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
• The two-machine no-wait general and proportionate open shop makespan problem
• Model formulations for the machine scheduling problem with limited waiting time constraints
• scientific article; zbMATH DE number 1279216 (Why is no real title available?)
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
• scientific article; zbMATH DE number 5260089 (Why is no real title available?)
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Reentrant open shop scheduling problem with time lags and no-wait constraints
• New efficient algorithms for the two-machine no-wait chain-reentrant shop problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707009)