On the minimization of total weighted flow time with identical and uniform parallel machines
- 16 February 1999
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 113 (1), 91-100
- https://doi.org/10.1016/s0377-2217(97)00427-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A new dynamic programming algorithm for the parallel machines total weighted completion time problemOperations Research Letters, 1992
- New Bounds for the Identical Parallel Processor Weighted Flow Time ProblemManagement Science, 1992
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtimeInternational Journal of Production Research, 1988
- Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time ProblemSIAM Journal on Computing, 1986
- An Improved Algorithm for Scheduling Jobs on Identical MachinesA I I E Transactions, 1977
- Scheduling Jobs on a Number of Identical MachinesA I I E Transactions, 1974
- Scheduling with parallel processors and linear delay costsNaval Research Logistics Quarterly, 1973
- A Functional Equation and its Application to Resource Allocation and Sequencing ProblemsManagement Science, 1969
- Scheduling Independent Tasks on Parallel ProcessorsManagement Science, 1966
- Bounds for the Optimal Scheduling of n Jobs on m ProcessorsManagement Science, 1964