ALGORITHMS TO MINIMIZE COMPLETION-TIME VARIANCE IN A 2 MACHINE FLOWSHOP

This paper presents algorithms to minimize the variance of completion time (CTV) when n jobs have to be processed on two machines. All the j obs visit the machines in the same order or technological sequence. Th ese algorithms are applicable in manufacturing systems where both the facilities could be within the factory or situations where one facilit y represents the bottleneck machine within the shop floor while the ot her represents the subcontractor facility. The problem is also applica ble in file handling systems where two individuals have to process fil es in a fixed sequence. The paper presents heuristic algorithms that i dentify the sequence of jobs that minimizes completion time variance. The solutions are compared with a lower bound and are found to give re sults in the range of 5-10% deviation from the lower bound. In additio n, the simulated annealing algorithm developed in this paper gives the optimum solution for all the problems tested up to 11 jobs. (C) 1998 Elsevier Science Ltd. All rights reserved.