Preemptive scheduling to minimize mean weighted flow time
From MaRDI portal
Publication:910208
DOI10.1016/0020-0190(90)90229-QzbMATH Open0695.68029MaRDI QIDQ910208FDOQ910208
Authors: Joseph Y.-T. Leung, Gilbert H. Young 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
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)
Cites Work
- Scheduling independent tasks to reduce mean finishing time
- Some simple scheduling algorithms
- Title not available (Why is that?)
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
- Title not available (Why is that?)
- Minimizing mean flow time with error constraint
- Title not available (Why is that?)
Cited In (11)
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Scheduling chains to minimize mean flow time
- Scheduling semi-malleable jobs to minimize mean flow time
- Preemptive scheduling with availability constraints to minimize total weighted completion times
- Preemptive scheduling of equal-length jobs in polynomial time
- Parallel machine problems with equal processing times: a survey
- The complexity of mean flow time scheduling problems with release times
- 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 scheduling cycle shops: Classification, complexity and approximation
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
This page was built for publication: Preemptive scheduling to minimize mean weighted flow time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910208)
