Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs

DOI10.1287/mnsc.40.12.1712zbMath0824.90080MaRDI QIDQ4838332

A. M. A. Hariri, Chris N. Potts

Publication date: 17 July 1995

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.40.12.1712

zbMATH Keywords

branch-and-bound; deadlines; due dates; single machine scheduling; state-space relaxation

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

Scheduling with tails and deadlines, Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date, Single machine scheduling with release times, deadlines and tardiness objectives, A survey of single machine scheduling to minimize weighted number of tardy jobs, Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances, Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem, Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Unary NP-hardness of minimizing the number of tardy jobs with deadlines