Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness

DOI10.1016/J.ORL.2009.04.004zbMath1173.90412OpenAlexW2057653555MaRDI QIDQ1038111

J. Blot

Publication date: 17 November 2009

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

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

zbMATH Keywords

single machinepreemptive schedulingtotal tardiness

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Modeling single machine preemptive scheduling problems for computational efficiency ⋮ New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Cites Work

• An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness
• Survey of scheduling research involving due date determination decisions
• Minimizing Total Tardiness on One Machine is NP-Hard
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with release times, deadlines and tardiness objectives
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness