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

Journal

Journal of Scheduling
ISSN: 1094-6136

Output data

Year: 2015, Volume: 19, Number: 1, Pages: 61-72 Pages count : 12 DOI: 10.1007/s10951-015-0454-9

Tags

Mixed-shop scheduling; Polynomial-time algorithms; Preemption

Authors

Dugarzhapov Aldar ^2,3 , Kononov Alexander ^1,2

Affiliations

1	Sobolev Institute of Mathematics, Novosibirsk, Russia
2	Novosibirsk State University, Novosibirsk, Russia
3	École Polytechnique, Palaiseau, France

Dugarzhapov A. , Kononov A.
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job
Journal of Scheduling. 2015. V.19. N1. P.61-72. DOI: 10.1007/s10951-015-0454-9 WOS Scopus OpenAlex

Published online:

Sep 28, 2015