𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling to minimize maximum lateness on unequal parallel processors

✍ Scribed by Prabuddha De; Thomas E. Morion

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
965 KB
Volume
9
Category
Article
ISSN
0305-0548

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

Note: Open-shop scheduling with release
Note: Open-shop scheduling with release dates to minimize maximum lateness
✍ Hans Kellerer; Thomas Tautenhahn; Gerhard Woeginger πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 295 KB πŸ‘ 2 views

We present the first polynomial-time algorithm for an open-shop problem with unit execution times, arbitrary release dates, and due dates. The objective is to minimize maximum lateness. 0 I995 John Wiley & Sons. Inc.

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