A Note on Open Shop Preemptive Schedules

DOI10.1109/TC.1979.1675246MaRDI QIDQ3856092zbMATH OpenOpenAlexFDO

Authors Teofilo F. Gonzalez

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

zbMATH Keywords

finish timeopen shopspolynomial complexitypreemptive scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(13)

• On the complexity of preemptive open-shop scheduling problems
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival
• On the complexity of generalized due date scheduling problems
• The generalized shifting bottleneck procedure
• On the complexity of preemptive openshop scheduling problems
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• 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
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A complete 4-parametric complexity classification of short shop scheduling problems
• Scheduling ordered open shops
• Properties of optimal schedules in preemptive shop scheduling
• Scheduling preemptive open shops to minimize total tardiness

This page was built for publication: A Note on Open Shop Preemptive Schedules

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