๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On-line scheduling on an unbounded parallel batch machine to

โœ Scribed by Ruyan Fu; Ji Tian; Jinjiang Yuan

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The optimal on-line parallel machine sch
The optimal on-line parallel machine scheduling
โœ Yong He ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 271 KB

This paper investigates on-line parallel machine scheduling problems. We show the optimality of the classical LS algorithm. (~) 2000 Elsevier Science Ltd. All rights reserved.

Batch scheduling with deadlines on paral
Batch scheduling with deadlines on parallel machines: An NP-hard case
โœ Mikhail Y. Kovalyov; Yakov M. Shafransky ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 529 KB

The problem of scheduling groups of jobs on unrelated parallel machines in batches subject to group deadlines was studied by Brucker et al. ( 1997) and Kovalyov and Shafransky ( 1994). A classification of computational complexities of special cases was provided only for the situation when all groups