Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
From MaRDI portal
Publication:1767711
DOI10.1016/j.ejor.2003.10.043zbMath1057.90024OpenAlexW2090799175MaRDI 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
Related Items
Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Equivalence of some different maintenance activities in single-machine scheduling ⋮ SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs ⋮ Modeling single machine preemptive scheduling problems for computational efficiency
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item