PERIODIC FLOW LINE SCHEDULING

We consider a deterministic situation in which identical batches of n jobs are to be scheduled on an m -machine flow line in each of k successive arrival perods of duration T . We derive the transient and steady-state properties of this periodic a flow line under the assumption that a common (but arbitrary) job sequence is employed for each batch of jobs. In particular, we derive the condition for steadystate; show that under this condition steady-state is achieved in a finite number of arrival periods; and demonstrate the relationships between job sequencing and steady-state throughput and work in process. We further derive the conditions under which finite delays on any machine lead to a permanent degradation of regular performance measures.