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

Scheduling jobs to two machines subject to batch arrival ordering

โœ Scribed by Arie Tamir


Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
410 KB
Volume
26
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 time 0(n^5^) is developed, and computational experience is reported.


๐Ÿ“œ SIMILAR VOLUMES