Scheduling job operations in an automatic assembly line

The problem of scheduling job operations in an automatic assembly line used for manufacturing a small to medium volume of mixed workparts is addressed. The assembly line model differs from the classical flow shop model in the following three aspects: (1) there are no buffers at machine stations, (2) constraints associated with the material transport system are included, and (3) for each batch production, workparts are distinguished in groups, rather than individually. An optimal algorithm that requires very little computation is derived by minimizing the total finish time for two machine assembly lines. This result is generalized to the problem of scheduling an assembly line with m>2 machines processing single-operation jobs. In order to reduce the computational complexity of the latter problem, heuristic algorithms are also proposed and shown to work quite well for all the cases considered. The solution to the problem of scheduling an assembly line with m >2 machines processing multioperation jobs is discussed