Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
From MaRDI portal
Publication:1767711
DOI10.1016/j.ejor.2003.10.043zbMath1057.90024MaRDI QIDQ1767711
Publication date: 8 March 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.10.043
90B35: Deterministic scheduling theory in operations research
Related Items
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs, SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximability of scheduling with fixed jobs
- Minimizing Total Tardiness on One Machine is NP-Hard
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems