Complexity of a scheduling problem with controllable processing times

DOI10.1016/j.orl.2009.10.011zbMath1185.90070OpenAlexW2074086542MaRDI QIDQ969518

Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo

Publication date: 7 May 2010

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.10.011

zbMATH Keywords

single machineNP-hardtotal weighted completion timecontrollable processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Batch scheduling of identical jobs with controllable processing times

Cites Work

• Unnamed Item
• Some comments on sequencing with controllable processing times
• Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard.
• A survey of scheduling with controllable processing times
• Resource Management in Machine Scheduling Problems: A Survey

This page was built for publication: Complexity of a scheduling problem with controllable processing times