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

Single machine parallel batch scheduling subject to precedence constraints

โœ Scribed by T.C.E. Cheng; C.T. Ng; J.J. Yuan; Z.H. Liu

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
90 KB
Volume
51
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Scheduling jobs to two machines subject
Scheduling jobs to two machines subject to batch arrival ordering
โœ Arie Tamir ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 410 KB

## Abstract The problem considered is to assign __n__ jobs to two processors so as to minimize the total flow time, with the constraint that a predetermined partial ordering (induced by batch arrivals) must be preserved within the subset of jobs assigned to each processor. An efficient algorithm of

A note on scheduling parallel machines s
A note on scheduling parallel machines subject to breakdown and repair
โœ Joseph Y.-T. Leung; Michael Pinedo ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB

## Abstract In this paper we consider __n__ jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time __t__ equal to __m__(__t__). Preemptions are allowed. We consider three objectives, namely, t