Impact of the Production Mix Preservation on the ORV Problem
We present a sequencing problem given on JIT (Just In Time) manufacturing environments, with the objective of minimizing the variation of manufacturing rates (ORV: Output Rate Variation). Specifically, we propose an extension based on requiring to the sequences the preservation of the production mix throughout the products manufacturing. To solve the ORV and the extended problem, we propose algorithms based on BDP (Bounded Dynamic Programming) and we perform two computational experiments based on instances from the literature.
KeywordsAutomobile industry JIT manufacturing Sequences Scheduling algorithms Dynamic programming Heuristics
Unable to display preview. Download preview PDF.