Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

DOI10.1016/j.orl.2009.09.003zbMath1176.90250OpenAlexW2023687380MaRDI QIDQ1043248

Nodari Vakhania

Publication date: 7 December 2009

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

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

zbMATH Keywords

algorithmschedulingtime complexityrelease timelate job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Theoretical expectation versus practical performance of Jackson's heuristic ⋮ Branch less, cut more and minimize the number of late equal-length jobs on identical machines

Cites Work

• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs