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

DOI10.1016/0893-9659(89)90095-5zbMath0704.90043OpenAlexW2071730558MaRDI QIDQ917428

C. C. S. Sin, Cheng, T. C. Edwin

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90095-5

zbMATH Keywords

parallel machinesNP-completenesssimultaneously available jobsweighted sum of machine makespans

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items

On the NP-completeness of the n/m/parallel/\(\sum_{i\leq i\leq m}\{\sum w_ j\sum t_ j\}\) scheduling problem, A state-of-the-art review of parallel-machine scheduling research, Dynamic programming approach to the \(n/m/\)parallel\(/\sum_{i=1}^{m} \{\sum {w_ j} \sum {t_ j} \}\) scheduling problem

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