Minimizing the weighted number of tardy jobs on parallel processors

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

Robert L. Bulfin, Rym M'Hallah

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 optimizationSchedulingBranch and boundSurrogate relaxation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (11)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Maximizing the weighted number of just-in-time jobs in flow shop scheduling ⋮ Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs ⋮ Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs ⋮ Reducing tardy batches by \textit{seru} production: model, exact solution, cooperative coevolution solution, and insights ⋮ Truck scheduling in cross-docking terminals with fixed outbound departures ⋮ Scheduling jobs on parallel machines to minimize a regular step total cost function ⋮ An exact approach for scheduling jobs with regular step cost functions on a single machine ⋮ A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity ⋮ Fast LP models and algorithms for identical jobs on uniform parallel machines ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods

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

This page was built for publication: Minimizing the weighted number of tardy jobs on parallel processors