Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
From MaRDI portal
(Redirected from Publication:632665)
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
- scientific article; zbMATH DE number 3156378 (Why is no real title available?)
- scientific article; zbMATH DE number 40477 (Why is no real title available?)
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- 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
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- Branch-and-Bound Methods: General Formulation and Properties
- Dominance-based heuristics for one-machine total cost scheduling problems
- Ordonnancements à contraintes disjonctives
- Scheduling equal-length jobs on identical parallel machines
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
Cited in
(12)- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
- A new lower bounding scheme for the total weighted tardiness problem.
- Dominance-based heuristics for one-machine total cost scheduling problems
- Dynamic scheduling of patients in emergency departments
- ON A DOMINANCE TEST FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH RELEASE DATES TO MINIMIZE TOTAL FLOW TIME
- Parallel machine scheduling with eligibility constraints: a composite dispatching rule to minimize total weighted tardiness
- Multi-machine scheduling lower bounds using decision diagrams
- On the integration of theoretical single-objective scheduling results for multi-objective problems
- On the exact solution of a large class of parallel machine scheduling problems
- A simulation-based differential evolution algorithm for stochastic parallel machine scheduling with operational considerations
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)
