Minimizing flow time on a constant number of machines with preemption

DOI10.1016/j.orl.2004.07.008zbMath1140.90389OpenAlexW2147877827MaRDI QIDQ1779706

Nikhil Bansal

Publication date: 1 June 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2004.07.008

zbMATH Keywords

SchedulingPreemptionFlow timeApproximation schemesMultiple machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Minimizing Average Flow Time on Unrelated Machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• Minimizing mean flow time with release time constraint
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Minimizing the flow time without migration
• Improved approximation schemes for scheduling unrelated parallel machines
• Approximation schemes for preemptive weighted flow time
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

This page was built for publication: Minimizing flow time on a constant number of machines with preemption