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

Unbounded parallel-batching scheduling with two competitive agents

โœ Scribed by Shisheng Li, Jinjiang Yuan

Book ID
118803735
Publisher
Springer US
Year
2011
Tongue
English
Weight
499 KB
Volume
15
Category
Article
ISSN
1094-6136

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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