Minimizing the number of late jobs when the start time of the machine is variable

DOI10.1016/j.orl.2012.05.006zbMath1250.90034OpenAlexW2027192197MaRDI QIDQ1758276

Vincent T'kindt, Hoogeveen, J. A.

Publication date: 8 November 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.05.006

zbMATH Keywords

single machine scheduling\(\epsilon \)-constraint approachnumber of late jobsPareto optimal points

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs ⋮ Scheduling to tradeoff between the number and the length of accepted jobs ⋮ A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine

Cites Work

• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Multicriteria scheduling
• Multicriteria scheduling problems: a survey
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs