Approximation schemes for preemptive weighted flow time
Authors:
Open Access
- 19 May 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 297-305
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Algorithms for minimizing weighted flow time2001
- Approximating total flow time on parallel machines1997
- Approximability and nonapproximability results for minimizing total flow time on a single machine1996
- Formulating the single machine sequencing problem with release dates as a mixed integer programDiscrete Applied Mathematics, 1990
- Complexity of Machine Scheduling Problems1977
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956