𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling on uniform parallel machines to minimize maximum lateness

✍ Scribed by Christos Koulamas; George J. Kyparisis

Book ID
108410406
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
91 KB
Volume
26
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling identical jobs with unequal r
Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness
✍ 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

A simulated annealing approach to minimi
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
✍ Kai Li; Shan-Lin Yang; Hua-Wei Ma πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 314 KB

This paper considers the uniform parallel machine scheduling problem which is to minimize the maximum lateness. This problem is equivalent to the uniform parallel machine scheduling problem, which is to minimize the maximal completion time of n jobs whose release times are zero, processing times dep