𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Makespan minimization for two parallel machines with an unavailable period on each machine

✍ Scribed by Chien-Hung Lin; Ching-Jong Liao

Publisher
Springer
Year
2006
Tongue
English
Weight
172 KB
Volume
33
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Approximation Algorithm for
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
✍ Chandra Chekuri; Michael Bender πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 107 KB

We give a new and efficient approximation algorithm for scheduling precedenceconstrained jobs on machines with different speeds. The problem is as follows. We are given n jobs to be scheduled on a set of m machines. Jobs have processing times and machines have speeds. It takes p j /s i units of time