Cyclic Sequences for Min-Max Objective in MixedModel Just-in-Time Production System

Abstract

Cyclic scheduling has received considerable attention in recent years as an effectivetechnique for repetitive manufacturing.Cyclic scheduling has been primarily studiedunder deterministic assumptions. In practice, stochastic variability exists and must betaken into account. The cyclic scheduling problems that arise in manufacturing arestudied in this dissertation. Starting with practical Just-in-Time sequencing problem withgiven set of sequences as precedence constraints, efficient algorithm which obtains anoptimal solution for the maximum deviation objective in the single level is studied. Fromthis study, formulation for solving min-max-absolute-chainproblem in cyclic paradigm isintroduced. Moreover, the study purposes algorithms for implementation of cyclicversion of min-max-absolute-chain problem. With its implementation, repetitivemanufacturing industry could benefit.