An Algorithm for the Open-Shop Problem
From MaRDI portal
Publication:4744043
DOI10.1287/moor.8.1.100zbMath0506.90037OpenAlexW1976196035WikidataQ113239980 ScholiaQ113239980MaRDI QIDQ4744043
Publication date: 1983
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.8.1.100
NP-completenesspolynomial algorithmsopen-shop problemexecution time conditioninteger-making techniquesspecial problem class
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)
Related Items
On some geometric methods in scheduling theory: A survey, Some positive news on the proportionate open shop problem, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, Nonpreemptive open shop with restricted processing times, Open shop scheduling with maximal machines, The Open Shop Scheduling Problem, Open-shop dense schedules: properties and worst-case performance ratio, Four decades of research on the open-shop scheduling problem to minimize the makespan, The museum visitor routing problem, Scheduling ordered open shops, Open block scheduling in optical communication networks, An iterative improvement approach for the nonpreemptive open shop scheduling problem, The generalized shifting bottleneck procedure, A polynomial-time open-shop problem with an arbitrary number of machines, Makespan minimization in open shops: A polynomial time approximation scheme, Scheduling in network flow shops, On the complexity of preemptive open-shop scheduling problems
