𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times

✍ Scribed by Purushothaman Damodaran; Mario C. Velez-Gallego

Publisher
Springer
Year
2009
Tongue
English
Weight
537 KB
Volume
49
Category
Article
ISSN
0268-3768

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

Minimizing makespan on a single batching
Minimizing makespan on a single batching machine with release times and non-identical job sizes
✍ Shuguang Li; Guojun Li; Xiaoli Wang; Qiming Liu πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 214 KB

We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + , where ΒΏ 0 can be made arbitrarily small.