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

DOI10.1016/J.EJOR.2009.05.013MaRDI QIDQ1038367zbMATH OpenOpenAlexFDO

Authors Cheng He, Jinjiang Yuan, 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 setdeadlinenumber of tardy jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
• Single machine scheduling with release times, deadlines and tardiness objectives
• Single machine scheduling with deadlines, release and due dates
• An exact method to minimize the number of tardy jobs in single machine scheduling

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 1167865 (Why is no real title available?)
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• Combinatorial optimization. Theory and algorithms.
• Monge properties, discrete convexity and applications
• Necessary and sufficient conditions of optimality for some classical scheduling problems

Cited in

(13)

• Scheduling to tradeoff between the number and the length of accepted jobs
• Single-machine scheduling with positional due indices and positional deadlines
• Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
• A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• A note on a single machine scheduling problem with generalized total tardiness objective function
• Energy-efficient deadline scheduling for heterogeneous systems
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• A note on lot scheduling on a single machine to minimize maximum weighted tardiness
• Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1038367)