Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem

DOI10.1016/0893-9659(92)90070-PzbMath0758.90046OpenAlexW2081008184MaRDI QIDQ1195679

Chung-Lun Li

Publication date: 5 January 1993

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(92)90070-p

zbMATH Keywords

parallel machinesdynamic programpseudo-polynomialweighted sum machine makespans

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem

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