On the complexity of scheduling jobs on dedicated resources to minimize set-up costs

DOI10.1016/0020-0190(80)90133-7zbMath0461.68044OpenAlexW1970209238MaRDI QIDQ1152708

Alan A. Bertossi

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

zbMATH Keywords

NP-hardnessdeterministic schedulingindependent jobs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Performance Guarantees for Scheduling Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: On the complexity of scheduling jobs on dedicated resources to minimize set-up costs