𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling identical jobs on uniform parallel machines with random processing times

✍ Scribed by Mohamed I. Dessouky; Richard L. Marcellus; Li Zhang

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
261 KB
Volume
35
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

For the problem of scheduing identical jobs on a set of uniform parallel machines with random processing times, methods are given for optimizing the expected sum of weighted completion times and the probability of meeting a common due date.

πŸ“œ 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

Scheduling jobs on parallel machines wit
Scheduling jobs on parallel machines with sequence-dependent setup times
✍ Young Hoon Lee; Michael Pinedo πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the