NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time

DOI10.1016/j.ejor.2006.02.014zbMath1107.90024OpenAlexW2000384174MaRDI QIDQ859949

N. E. Zubov

Publication date: 22 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/661

zbMATH Keywords

schedulingNP-hardnesstotal weighted completion timesingle-variable-resource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect

Cites Work

• Unnamed Item
• A multiple-criterion model for machine scheduling
• Sequencing independent jobs with a single resource

This page was built for publication: NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time