Dynamic programming algorithms for scheduling parallel machines with family setup times
From MaRDI portal
Recommendations
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
Cites work
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- scientific article; zbMATH DE number 3632203 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 10435 (Why is no real title available?)
- On the Complexity of Scheduling with Batch Setup Times
- Scheduling Groups of Jobs on a Single Machine
- Scheduling independent tasks to reduce mean finishing time
- Single facility multi-class job scheduling
- The complexity of scheduling job families about a common due date
Cited in
(15)- Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints
- Heuristic methods for the identical parallel machine flowtime problem with set-up times
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- A survey of scheduling problems with setup times or costs
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Unrelated parallel machine scheduling with new criteria: complexity and models
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Scheduling parallel machines to minimize weighted flowtime with family set-up times
- A heuristic hybrid framework for vector job scheduling
- A note on the scheduling with two families of jobs
This page was built for publication: Dynamic programming algorithms for scheduling parallel machines with family setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926032)
