An exact method to minimize the number of tardy jobs in single machine scheduling
From MaRDI portal
Publication:2464432
DOI10.1023/B:JOSH.0000046073.05827.15zbMath1154.90437OpenAlexW2064417193MaRDI QIDQ2464432
Marc Sevaux, Stéphane Dauzère-Pérès
Publication date: 20 December 2007
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:josh.0000046073.05827.15
Related Items
New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem ⋮ Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm ⋮ Minimizing the weighted number of tardy jobs on a single machine with release dates ⋮ Unrelated parallel machine scheduling with new criteria: complexity and models ⋮ Minimizing the sum of completion times on a single machine with health index and flexible maintenance operations ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem ⋮ Scheduling jobs on parallel machines to minimize a regular step total cost function ⋮ Optimality proof of the Kise-Ibaraki-Mine algorithm ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ Scheduling linear deteriorating jobs to minimize the number of tardy jobs ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances ⋮ Optimal admission control of discrete event systems with real-time constraints ⋮ Using short-term memory to minimize the weighted number of late jobs on a single machine.
