𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exact and approximate algorithms for high-multiplicity parallel machine scheduling

✍ Scribed by Carlo Filippi; Giorgio Romanin-Jacur

Publisher
Springer US
Year
2009
Tongue
English
Weight
481 KB
Volume
12
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
✍ Zhi-Long Chen; Warren B. Powell πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o

Exact and heuristic algorithms for paral
Exact and heuristic algorithms for parallel-machine scheduling with DeJong’s learning effect
✍ Dariusz OkoΕ‚owski; StanisΕ‚aw Gawiejnowicz πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 296 KB

## a b s t r a c t We consider a parallel-machine scheduling problem with a learning effect and the makespan objective. The impact of the learning effect on job processing times is modelled by the general DeJong's learning curve. For this NP-hard problem we propose two exact algorithms: a sequenti

An approximation algorithm for schedulin
An approximation algorithm for scheduling two parallel machines with capacity constraints
✍ Heng Yang; Yinyu Ye; Jiawei Zhang πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 205 KB

We consider the problem of scheduling n independent jobs on two identical parallel machines, with a limit on the number of jobs that can be assigned to each single machine, so as to minimize the total weighted completion time of the jobs. We study a semideΓΏnite programming-based approximation algori