A note on the single machine scheduling to minimize the number of tardy jobs with deadlines

DOI10.1016/j.ejor.2009.05.013zbMath1176.90220OpenAlexW2038017970MaRDI QIDQ1038367

Jinjiang Yuan, Cheng He, Yanpei Liu

Publication date: 17 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.05.013

zbMATH Keywords

schedulingindependent setnumber of tardy jobsdeadline

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ Energy-efficient deadline scheduling for heterogeneous systems ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Scheduling to tradeoff between the number and the length of accepted jobs ⋮ Single-machine scheduling with positional due indices and positional deadlines ⋮ Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Necessary and sufficient conditions of optimality for some classical scheduling problems
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Monge properties, discrete convexity and applications
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: A note on the single machine scheduling to minimize the number of tardy jobs with deadlines