Two-Machine Super-Shop Scheduling Problem
From MaRDI portal
Publication:3978740
DOI10.1057/jors.1991.96zbMath0742.90047OpenAlexW2037726054MaRDI QIDQ3978740
Publication date: 25 June 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1991.96
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Two-machine open-shop scheduling with rejection to minimize the makespan, 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 and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, A new three-machine shop scheduling: complexity and approximation algorithm, Complexity of mixed shop scheduling problems: A survey, METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM, Approximation algorithms for the three-machine proportionate mixed shop scheduling, Isomorphic scheduling problems, Scheduling two jobs with fixed and nonfixed routes
