Scheduling two-machine preemptive open shops to minimize total completion time

DOI10.1016/S0305-0548(03)00096-0zbMath1073.90013MaRDI QIDQ1885987

Ching-Fang Liaw

Publication date: 12 November 2004

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

On the complexity of proportionate open shop and job shop problems

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling ordered open shops
• On the complexity of preemptive open-shop scheduling problems
• A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
• Classical and new heuristics for the open-shop problem: A computational evaluation
• Constructive heuristic algorithms for the open shop problem
• On the complexity of preemptive openshop scheduling problems
• A branch \(\&\) bound algorithm for the open-shop problem
• A hybrid genetic algorithm for the open shop scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• Preemptive Scheduling, Linear Programming and Network Flows
• A Note on Open Shop Preemptive Schedules
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling the Open Shop to Minimize Mean Flow Time
• Minimizing Maximum Lateness in a Two-Machine Open Shop
• Open Shop Scheduling to Minimize Finish Time
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey