A note on the proof of the complexity of the little-preemptive open-shop problem
From MaRDI portal
Publication:763116
DOI10.1007/S10479-011-0975-3zbMath1233.90170OpenAlexW1993331643MaRDI QIDQ763116
Nodari Vakhania, Evgeny V. Shchepin
Publication date: 9 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0975-3
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
On the complexity of constructing multiprocessor little-preemptive schedules ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan
Cites Work
This page was built for publication: A note on the proof of the complexity of the little-preemptive open-shop problem
