Minimizing the weighted number of tardy jobs on parallel processors

DOI10.1016/j.ejor.2003.06.027zbMath1067.90047MaRDI QIDQ1887912

Rym M'Hallah, Robert L. Bulfin

Publication date: 22 November 2004

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

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

zbMATH Keywords

Combinatorial optimization; Scheduling; Branch and bound; Surrogate relaxation

Mathematics Subject Classification ID

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

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

Maximizing the weighted number of just-in-time jobs in flow shop scheduling, Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing the number of tardy jobs for \(m\) parallel machines
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
• Minimizing the weighted number of tardy jobs on a single machine
• Parallel Machine Scheduling by Column Generation
• An O(n) algorithm for the multiple-choice knapsack linear program
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Solving Parallel Machine Scheduling Problems by Column Generation
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs