On the two-phase method for preemptive scheduling

DOI10.1016/0377-2217(88)90332-3zbMath0652.90064OpenAlexW1988424649MaRDI QIDQ1107434

Dominique de Werra

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90332-3

zbMATH Keywords

flexible manufacturing systemsparallel processorstotal unimodularitytwo-phase methodPreemptive schedulingminimum total completion time

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ On preemptive scheduling: A general setting for the two-phase method ⋮ Almost nonpreemptive schedules ⋮ A Survey on Approximation Algorithms for Scheduling with Machine Unavailability ⋮ Mathematical programming formulations for machine scheduling: A survey ⋮ A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages

Cites Work

• Preemptive Scheduling, Linear Programming and Network Flows
• A decomposition property of polyhedra
• Variations on the integral decomposition property
• Preemptive scheduling with staircase and piecewise linear resource availability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item