Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

DOI10.1016/J.EJOR.2005.06.067MaRDI QIDQ856204zbMATH OpenOpenAlexFDO

Authors Yumei Huo, Joseph Y.-T. Leung, Hairong Zhao

Publication date 7 December 2006

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

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

zbMATH Keywords

heuristicsschedulingNP-hardnumber of tardy jobsmaximum weighted tardiness

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On bicriteria scheduling of due date assignment and weighted number of tardy jobs
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Complexity of single machine, multi-criteria scheduling problems
• Note: Bicriteria scheduling for minimizing flow time and maximum tardiness

Cites work

• scientific article; zbMATH DE number 1634827 (Why is no real title available?)
• scientific article; zbMATH DE number 3425355 (Why is no real title available?)
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• A note on a scheduling problem with dual criteria
• A note on the extension of a result on scheduling with secondary criteria
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• Complexity of single machine hierarchical scheduling: A survey
• Complexity of single machine, multi-criteria scheduling problems
• Complexity of two dual criteria scheduling problems
• Minimizing Total Costs in One-Machine Scheduling
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• One machine sequencing to minimize mean flow time with minimum number tardy
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Single Machine Early/Tardy Problem

Cited in

(14)

• A bicriterion scheduling problem involving total flowtime and total tardiness
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Single-machine scheduling with positional due indices and positional deadlines
• A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
• Unary NP-hardness of minimizing the number of tardy jobs with deadlines
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• scientific article; zbMATH DE number 5260995 (Why is no real title available?)
• Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
• Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
• Bicriterion parallel-machine scheduling of equal-length jobs to minimize total tardiness and number of tardy jobs
• A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem
• Single machine scheduling with few deadlines

This page was built for publication: Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

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