Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
From MaRDI portal
Publication:1960324
DOI10.1023/A:1018943016617zbMath0958.90038OpenAlexW1607976652MaRDI QIDQ1960324
Frank Werner, Natalia V. Shakhlevich, Yuri N. Sotskov
Publication date: 11 January 2000
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018943016617
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job, The three-machine proportionate open shop and mixed shop minimum makespan problems, Complexity of mixed shop scheduling problems: A survey, Complexity of shop-scheduling problems with fixed number of jobs: a survey, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, Approximation algorithms for the three-machine proportionate mixed shop scheduling