Scheduling identical jobs with unequal r
β
Maged M. Dessouky
π
Article
π
1998
π
Elsevier Science
π
English
β 308 KB
AbstractΓWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that