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

Batch scheduling with deadlines on parallel machines

โœ Scribed by Peter Brucker; Mikhail Y. Kovalyov; Yakov M. Shafransky; Frank Werner

Book ID
110379402
Publisher
Springer US
Year
1998
Tongue
English
Weight
186 KB
Volume
83
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Parallel machine batching and scheduling
Parallel machine batching and scheduling with deadlines
โœ T. C. Edwin Cheng; Mikhail Y. Kovalyov ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 137 KB ๐Ÿ‘ 1 views

In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled