Complexity of optimal scheduling problems with three jobs

DOI10.1007/BF01068549zbMath0800.68212MaRDI QIDQ4007431

Yuri N. Sotskov

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

NP-hardqueueing systemstime-optimal scheduling

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

• Open Shop Scheduling to Minimize Finish Time
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of optimal scheduling problems with three jobs