Balanced Schedules*
- 1 November 1971
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 9 (3) , 230-237
- https://doi.org/10.1080/03155986.1971.11731479
Abstract
In this paper a graph-theoretical model of a scheduling problem is described. A set U of jobs is given; each job u has to be performed by an agent x with a machine x; all individual completion times of the jobs are known. The problem isto find a schedule for which (a) the total completion time l is as small as possible, and (b) l may be partitioned into a given number k of periods T1, . . . , Tk such that each agent (and each machine) is working approximately during the same amount of time at each period. A simple algorithm is outlined for partitioning the set U into k subsets corresponding to the k periods.Keywords
This publication has 0 references indexed in Scilit: