Preemptive scheduling to minimize mean weighted flow time
From MaRDI portal
(Redirected from Publication:910208)
Cites work
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 3744543 (Why is no real title available?)
- scientific article; zbMATH DE number 3604658 (Why is no real title available?)
- Minimizing mean flow time with error constraint
- Preemptive Scheduling of Equal Length Jobs on Two Machines to Minimize Mean Flow Time
- Scheduling independent tasks to reduce mean finishing time
- Some simple scheduling algorithms
Cited in
(11)- 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
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- On the optimality of the earliest due date rule in stochastic scheduling and in queueing
- Parallel machine problems with equal processing times: a survey
- Preemptive scheduling on identical parallel machines subject to deadlines.
- The complexity of mean flow time scheduling problems with release times
- Scheduling chains to minimize mean flow time
- On scheduling cycle shops: Classification, complexity and approximation
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)
