Single machine scheduling with release times, deadlines and tardiness objectives
From MaRDI portal
Publication:5946156
DOI10.1016/S0377-2217(00)00207-1zbMath0976.90043OpenAlexW2021945696MaRDI QIDQ5946156
Christos P. Koulamas, Kyparisis, George J.
Publication date: 13 January 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00207-1
Related Items
Rescheduling with new orders and general maximum allowable time disruptions, Reducing network and computation complexities in neural based real-time scheduling scheme, A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization, Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines, Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness, The single-machine total tardiness scheduling problem: review and extensions, The one machine scheduling problem: insertion of a job under the real-time constraint
Cites Work
- Unnamed Item
- Unnamed Item
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates
- Two-Processor Scheduling with Start-Times and Deadlines
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The Total Tardiness Problem: Review and Extensions
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
