𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Heuristics for minimizing total completion time and maximum lateness on identical parallel machines with setup times

✍ Scribed by M. T. Yazdani Sabouni; F. Jolai; A. Mansouri

Publisher
Springer US
Year
2008
Tongue
English
Weight
278 KB
Volume
21
Category
Article
ISSN
0956-5515

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for minimizing
Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
✍ Joseph Y-T. Leung; Haibing Li; Michael Pinedo πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

## Abstract We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is re

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