Dynamic programming approach to the n/m/parallel/_i=1ᵐ \ w_ j t_ j \ scheduling problem
From MaRDI portal
Publication:1195679
Recommendations
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Scheduling on parallel processors with varying processing times
- Scheduling problems on parallel identical unbounded batch processing machines
Cites work
Cited in
(5)- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- scientific article; zbMATH DE number 3995429 (Why is no real title available?)
- Dynamic programming algorithms for scheduling parallel machines with family setup times
This page was built for publication: Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195679)
