A stronger complexity result for the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs

DOI10.1023/A:1026276627133zbMath1154.90427OpenAlexW1487971107MaRDI QIDQ2464405

Yanyan Li

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/a:1026276627133

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time ⋮ A survey of scheduling problems with setup times or costs