An Algorithm for the Open-Shop Problem

DOI10.1287/MOOR.8.1.100MaRDI QIDQ4744043zbMATH OpenOpenAlexWikidataFDO

Authors Tibor Fiala

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

zbMATH Keywords

execution time conditioninteger-making techniquesNP-completenessopen-shop problempolynomial algorithmsspecial problem class

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(18)

• On the complexity of preemptive open-shop scheduling problems
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• The generalized shifting bottleneck procedure
• Makespan minimization in open shops: A polynomial time approximation scheme
• On some geometric methods in scheduling theory: A survey
• Open shop scheduling with maximal machines
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• A polynomial-time open-shop problem with an arbitrary number of machines
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Open-shop dense schedules: properties and worst-case performance ratio
• Open block scheduling in optical communication networks
• Scheduling in network flow shops
• Some positive news on the proportionate open shop problem
• The open shop scheduling problem
• Nonpreemptive open shop with restricted processing times
• Scheduling ordered open shops
• The museum visitor routing problem

This page was built for publication: An Algorithm for the Open-Shop Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4744043)