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

DOI10.1016/j.ejor.2005.06.067zbMath1111.90042OpenAlexW2065269629MaRDI QIDQ856204

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

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) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ A hybrid multi-objective evolutionary algorithm approach for handling sequence- and machine-dependent set-up times in unrelated parallel machine scheduling problem ⋮ Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the number of late jobs in a stochastic setting using a chance constraint
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Complexity of single machine, multi-criteria scheduling problems
• Complexity of two dual criteria scheduling problems
• The Single Machine Early/Tardy Problem
• A note on a scheduling problem with dual criteria
• One machine sequencing to minimize mean flow time with minimum number tardy
• Minimizing Total Costs in One-Machine Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A note on the extension of a result on scheduling with secondary criteria
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

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