Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates

DOI10.1016/j.cor.2010.12.006zbMath1208.90066OpenAlexW1966888126MaRDI QIDQ632665

David Savourey, Antoine Jouglet

Publication date: 25 March 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.006

zbMATH Keywords

schedulingparallel machinestotal weighted tardinessdominance rulespossible machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Dynamic scheduling of patients in emergency departments ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates ⋮ On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems ⋮ A simulation‐based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• Scheduling on parallel identical machines to minimize total tardiness
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Scheduling equal-length jobs on identical parallel machines
• Dominance-based heuristics for one-machine total cost scheduling problems
• Ordonnancements à contraintes disjonctives
• Branch-and-Bound Methods: General Formulation and Properties
• A new dominance rule to minimize total weighted tardiness with unequal release dates.

This page was built for publication: Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates