A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job

DOI10.1007/s10951-015-0454-9zbMath1341.90043MaRDI QIDQ283266

F. Blanchet-Sadri, M. Dambrine

Publication date: 13 May 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-015-0454-9

zbMATH Keywords

polynomial-time algorithms; preemption; mixed-shop scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems