Complete Complexity Classification of Short Shop Scheduling

Authors:
Alexander Kononov;Sergey Sevastyanov;Maxim Sviridenko
Affiliations:
Sobolev Institute of Mathematics, Novosibirsk, Russia and Novosibirsk State University, Novosibirsk, Russia;Sobolev Institute of Mathematics, Novosibirsk, Russia and Novosibirsk State University, Novosibirsk, Russia;IBM T.J. Watson Research Center, Yorktown Heights, USA
Venue:
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Year:
2009

Citing 5
Cited 1

An algorithm for solving the job-shop problem

Management Science
Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
Minimizing Makespan in No-Wait Job Shops

Mathematics of Operations Research
The edge chromatic number of a directed-mixed multigraph

Journal of Graph Theory

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

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a comprehensive complexity analysis of classical shop scheduling problems (open shop, job shop and mixed shop) is presented subject to joint constraints on several problem parameters, such as the maximum processing time of an operation, the maximum number of operations per job, and the schedule length. Thus, our research continues the research line on the complexity analysis of short scheduling initiated for the open shop and job shop problems in the paper by Williamson et al. (1997). We improve upon some of the results in that paper.