Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
From MaRDI portal
Publication:632665
DOI10.1016/J.COR.2010.12.006zbMATH Open1208.90066OpenAlexW1966888126MaRDI QIDQ632665FDOQ632665
Authors: Antoine Jouglet, David Savourey 
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
Recommendations
- Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Parallel machine scheduling with eligibility constraints: a composite dispatching rule to minimize total weighted tardiness
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Scheduling parallel machines to minimize total weighted and unweighted tardiness
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Parallel-machine scheduling with release dates and rejection
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Branch-and-Bound Methods: General Formulation and Properties
- Ordonnancements à contraintes disjonctives
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Scheduling equal-length jobs on identical parallel machines
- A new dominance rule to minimize total weighted tardiness with unequal 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
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Dominance-based heuristics for one-machine total cost scheduling problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- Title not available (Why is that?)
Cited In (12)
- Dominance-based heuristics for one-machine total cost scheduling problems
- ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
- On the exact solution of a large class of parallel machine scheduling problems
- Multi-machine scheduling lower bounds using decision diagrams
- A simulation-based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness 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
- Dynamic scheduling of patients in emergency departments
- Parallel machine scheduling with eligibility constraints: a composite dispatching rule to minimize total weighted tardiness
- A new lower bounding scheme for the total weighted tardiness problem.
This page was built for publication: Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632665)
