𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel machine scheduling with time dependent processing times

✍ Scribed by Zhi-Long Chen

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
598 KB
Volume
70
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two machine openshop scheduling with mac
Two machine openshop scheduling with machine-dependent processing times
✍ Asoo J. Vakharia; BΓΌlent Γ‡atay πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 408 KB

In a recent paper, Dror (1992) presented several results for openshop scheduling with machine dependent processing times. In this note, we present clarifications regarding the algorithm developed by him for minimizing the sum of job completion times (or average flow time) in a 2 machine openshop and

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