On the complexity of constructing multiprocessor little-preemptive schedules

DOI10.1134/S0081543815060152zbMath1332.90081OpenAlexW2265199291MaRDI QIDQ902062

Evgeny V. Shchepin

Publication date: 7 January 2016

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543815060152

zbMATH Keywords

open shop problem

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (1)

Four decades of research on the open-shop scheduling problem to minimize the makespan

Cites Work

• A note on the proof of the complexity of the little-preemptive open-shop problem
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling
• An optimal rounding gives a better approximation for scheduling unrelated machines
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of constructing multiprocessor little-preemptive schedules