Multi-job cyclic scheduling for a network with complicated processes. (A scheduling method with division of jobs)

Abstract

A multi-job cyclic scheduling problem, in which production processes of the jobs are various, as analyzed. In particular, a division policy of the jobs was introduced to obtain a non-idle schedule. In the non-idle schedule, the bottleneck machine produces jobs without idle time in a steady state. A dividing method of the jobs and loading methods of the divided jobs into a manufacturing system were discussed. Based on the methods proposed, a new cyclic scheduling method was constructed to obtain the non-idle schedule. A numerical example was demonstrated to clarify the scheduling method.