A new dynamic programming algorithm for the parallel machines total weighted completion time problem

Authors:
Chung-Yee Lee;Reha Uzsoy
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA;School of Industrial Engineering, Purdue University, West Lafayette, IN 47907, USA
Venue:
Operations Research Letters
Year:
1992

Citing 4
Cited 1

Worst case bound of an LRF schedule for the mean weighted flow-time problem

SIAM Journal on Computing
Algorithms for Scheduling Independent Tasks

Journal of the ACM (JACM)
Scheduling independent tasks to reduce mean finishing time

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an alternative dynamic programming algorithm with pseudopolynomial complexity for the problem of minimizing total weighted completion time on parallel identical machines. The algorithm is polynomial in the sum of all job weights, unlike the classical approaches which are polynomial in the sum of processing times.