Scheduling identical parallel machines to minimize total weighted completion time

Authors:
H. Belouadah;C. N. Potts
Affiliations:
-;-
Venue:
CO89 Selected papers of the conference on Combinatorial Optimization
Year:
1994

Citing 0
Cited 4

An exact method for Pm/sds,ri/Σi=1nCi problem

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

Computers and Operations Research
A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of Scheduling
A global constraint for total weighted completion time for unary resources

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract