On the complexity of preemptive openshop scheduling problems
From MaRDI portal
Publication:1333531
DOI10.1016/0377-2217(94)90406-5zbMath0809.90085OpenAlexW2000402111MaRDI QIDQ1333531
Chelliah Skriskandarajah, Edouard Wagneur
Publication date: 15 September 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90406-5
NP-hardmaximum latenesstotal weighted tardinessmean flow timenumber of late jobspreemptive openshop scheduling
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (4)
Scheduling two-machine preemptive open shops to minimize total completion time ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness ⋮ Open shops with jobs overlap
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling ordered open shops
- On the complexity of preemptive open-shop scheduling problems
- Scheduling open shops with parallel machines
- Open shops with jobs overlap
- A Note On The Complexity Of Openshop Scheduling Problems
- 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
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Unit Execution Time Shop Problems
- Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
- Open Shop Scheduling to Minimize Finish Time
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
This page was built for publication: On the complexity of preemptive openshop scheduling problems
