Preemptive scheduling to minimize mean weighted flow time

DOI10.1016/0020-0190(90)90229-QzbMath0695.68029MaRDI QIDQ910208

Gilbert H. Young, Joseph Y.-T. Leung

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

NP-completenessNP-hardnesspreemptive schedulingmean weighted flow time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Complexity of computation (including implicit computational complexity) (03D15)

Related Items

The complexity of mean flow time scheduling problems with release times, Preemptive scheduling of equal-length jobs in polynomial time, Parallel machine problems with equal processing times: a survey, Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms, Preemptive scheduling on identical parallel machines subject to deadlines., On the optimality of the earliest due date rule in stochastic scheduling and in queueing, On scheduling cycle shops: Classification, complexity and approximation, New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria

Cites Work

• Minimizing mean flow time with error constraint
• Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
• Some simple scheduling algorithms
• Scheduling independent tasks to reduce mean finishing time
• Unnamed Item
• Unnamed Item
• Unnamed Item