Preemptive scheduling on uniform machines to minimize mean flow time
From MaRDI portal
Publication:1017456
DOI10.1016/j.cor.2008.12.010zbMath1160.90475WikidataQ57633894 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
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Preemptive scheduling of two uniform parallel machines to minimize total tardiness, A multi-objective optimization for preemptive identical parallel machines scheduling problem, Parallel machine problems with equal processing times: a survey, The ``least flexible job first rule in scheduling and in queueing
Cites Work