A Complete 4-parametric complexity classification of short shop scheduling problems

A Complete 4-parametric complexity classification of short shop scheduling problems Full article

Journal

Journal of Scheduling
ISSN: 1094-6136

Output data

Year: 2012, Volume: 15, Number: 4, Pages: 427-446 Pages count : 20 DOI: 10.1007/s10951-011-0243-z

Tags

Complexity classification; Makespan minimization; Shop scheduling

Authors

Kononov Alexander ¹ , Sevastyanov Sergey ^1,2 , Sviridenko Maxim ³

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
2	Novosibirsk State University of Economics and Management
3	IBM T.J. Watson Research Center, Yorktown Heights, USA

Kononov A. , Sevastyanov S. , Sviridenko M.
A Complete 4-parametric complexity classification of short shop scheduling problems
Journal of Scheduling. 2012. V.15. N4. P.427-446. DOI: 10.1007/s10951-011-0243-z WOS Scopus OpenAlex

Published online:

Jul 22, 2011

Web of science:	WOS:000304706100004
Scopus:	2-s2.0-84865608416
OpenAlex:	W1987322775

DB	Citing
Scopus	10
OpenAlex	9
Web of science	9