Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging

Solving the level (or balanced) schedule problem is the most important scheduling goal for just-in-time production assembly systems. For most industrial applications, determining the optimal balanced schedule in a multi-level facility is a very difficult combinatorial problem. However, if outputs at production levels which feed the final assembly level are dedicated or ‘pegged’ to the final product into which they will be assembled, then it can be shown that an efficient scheduling algorithm can be implemented to determine the optimal level schedule. It can also be shown that several symmetrical properties of the pegging model can be exploited to significantly reduce the computational requirements of the problem.