𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing maximum lateness on identical parallel machines with flexible resources and machine eligibility constraints

✍ Scribed by Ling-Huey Su; Wei-Yi Chang; Fuh-Der Chou

Publisher
Springer
Year
2011
Tongue
English
Weight
320 KB
Volume
56
Category
Article
ISSN
0268-3768

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