What is it about?
This paper presents an overview on existing results for the complexity of so-called mixed shop scheduling problems, where e.g. some jobs have a fixed technological route and others not.
Featured Image
Why is it important?
It is a state-of-the-art survey from the time around the year 2000.
Read the Original
This page is a summary of: Complexity of mixed shop scheduling problems: A survey, European Journal of Operational Research, January 2000, Elsevier,
DOI: 10.1016/s0377-2217(99)00161-7.
You can read the full text:
Contributors
The following have contributed to this page
