A Note on Open Shop Preemptive Schedules
From MaRDI portal
Publication:3856092
DOI10.1109/TC.1979.1675246zbMath0422.68007OpenAlexW1968297724MaRDI QIDQ3856092
Publication date: 1979
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1979.1675246
Related Items
On the complexity of preemptive openshop scheduling problems, Scheduling two-machine preemptive open shops to minimize total completion time, 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, Properties of optimal schedules in preemptive shop scheduling, A complete 4-parametric complexity classification of short shop scheduling problems, An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., On the complexity of generalized due date scheduling problems, Four decades of research on the open-shop scheduling problem to minimize the makespan, Scheduling preemptive open shops to minimize total tardiness, Scheduling ordered open shops, The generalized shifting bottleneck procedure, On the complexity of preemptive open-shop scheduling problems
