On the complexity of scheduling jobs on dedicated resources to minimize set-up costs
From MaRDI portal
Publication:1152708
DOI10.1016/0020-0190(80)90133-7zbMath0461.68044MaRDI QIDQ1152708
Publication date: 1980
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(80)90133-7
68Q25: Analysis of algorithms and problem complexity
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work