Abstract
A polynomial time algorithm was given by Fiala for the nonpreemptivem-processor open shop problem whenever the sum of processing times for one processor is large enough with respect to the maximal processing time. Here a special case where all processing times are from a bounded cardinality set of nonnegative integers is studied. For such a situation we give anO(nm) algorithm while the algorithm of Fiala works inO(n 2 m 3) wheren is the number of jobs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Blazewicz J, Cellary W, Slowinski R, Weglarz J (1986) Scheduling under resource constraints.Deterministic models, Baltzer AG, Basel
de Werra D (1984) Preemptive scheduling, linear programming and network flows.SIAM Journal on algebraic and discrete methods 5:11–20
Fiala T (1983) An algorithm for an open shop problem.Mathematics of Operations Research, 8, 1: February 100–109
Garey MR, Johnson DS (1979) Computers and intractability — a guide to the theory of NP-completeness.Freeman, San Francisco
Gonzales T, Sahni S (1976) Open shop scheduling to minimize finish time.Journal of the ACM 23, 4:665–679
Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB Sequencing and scheduling: Algorithms and complexity.Report BF-R89, Center for mathematics and computer science, Amsterdam
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Čepek, O., Vlach, M. & de Werra, D. Nonpreemptive open shop with restricted processing times. ZOR - Methods and Models of Operations Research 39, 227–241 (1994). https://doi.org/10.1007/BF01415583
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415583