Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem

DOI10.1016/j.camwa.2010.09.046zbMath1207.90057MaRDI QIDQ630678

Ghasem Moslehi, Ehsan Molaee, Mohammad Reisi

Publication date: 19 March 2011

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.09.046

zbMATH Keywords

scheduling; single machine; efficient solution; maximum earliness; tardy jobs

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

MP or not MP: that is the question, A survey of single machine scheduling to minimize weighted number of tardy jobs, Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint

Cites Work

• Unnamed Item
• Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• Using genetic algorithms for single-machine bicriteria scheduling problems
• Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
• Multicriteria scheduling
• Scheduling with Multiple Performance Measures: The One-Machine Case
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs