Preemptive Scheduling, Linear Programming and Network Flows

DOI10.1137/0605003zbMath0532.90047OpenAlexW2060435333MaRDI QIDQ3315254

Dominique de Werra

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605003

zbMATH Keywords

network flowpreemptive schedulingbistochastic matricesBirkhoff-von Neumann theoremunrelated processors

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Random matrices (algebraic aspects) (15B52)

Related Items

On the complexity of preemptive openshop scheduling problems, Scheduling tasks on two processors with deadlines and additional resources, Minimizing mean flow time with parallel processors and resource constraints, On an optimization problem occurring in FMSs: A hypergraph-theoretical formulation, Scheduling two-machine preemptive open shops to minimize total completion time, A preemptive open shop scheduling problem with one resource, New trends in machine scheduling, On the two-phase method for preemptive scheduling, Nonpreemptive open shop with restricted processing times, On preemptive scheduling: A general setting for the two-phase method, A note on SS/TDMA satellite communication, Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource, Preemptive scheduling with staircase and piecewise linear resource availability, Algorithms for minimizing maximum lateness with unit length tasks and resource constraints, Mathematical programming formulations for machine scheduling: A survey

Cites Work

• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item