Preemptive scheduling on uniform machines to minimize mean flow time

DOI10.1016/J.COR.2008.12.010zbMath1160.90475DBLPjournals/cor/KravchenkoW09OpenAlexW1973847436WikidataQ57633894 ScholiaQ57633894MaRDI QIDQ1017456

Frank Werner, Svetlana A. Kravchenko

Publication date: 19 May 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.010

zbMATH Keywords

linear programmingpolynomial algorithmmaximum flowparallel uniform machines

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Parallel machine problems with equal processing times: a survey ⋮ Preemptive scheduling of two uniform parallel machines to minimize total tardiness ⋮ The ``least flexible job first rule in scheduling and in queueing

Cites Work

• The complexity of mean flow time scheduling problems with release times
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Complexity of preemptive minsum scheduling on unrelated parallel machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Preemptive scheduling on uniform machines to minimize mean flow time