BATCH SCHEDULING TO MINIMIZE CYCLE TIME, FLOW TIME, AND PROCESSING COST
Title:
BATCH SCHEDULING TO MINIMIZE CYCLE TIME, FLOW TIME, AND PROCESSING COST
Author:
Steiner, George Truscott, William G.
Appeared in:
IIE transactions
Paging:
Volume 25 (1993) nr. 5 pages 90-97
Year:
1993-09-01
Contents:
We consider a multi-stage batch processing system in which a group of identical units, requiring the same set of operations, is manufactured. In this system, work on the batch must be continuous at each operation, but the batch can be split into sub-batches for transfer between consecutive operations. We examine the case in which operations can be performed in any sequence, using cycle time, total flow time (static and dynamic), and processing cost as measures of performance. It is shown that these problems are closely related to a traveling-salesman problem with a special cost matrix. Optimal scheduling rules are developed for all measures of performance.