JIT: Just In Time / Douki Seisan sequencing
Solving the ORVP with Preservation of the Production Mix using BDP
Authors
Joaquin Bautista1, Rocío Alfaro1 and Alberto Cano1
Abstract
We present a sequencing problem given on JIT (Just In Time) manufacturing environments, with the objective of minimizing the variation of production rates (ORV: Output Rate Variation). We propose an extension of this problem based on to require, to the sequences, the preservation of the production mix throughout the manufacturing of the products. To solve the ORVP (Output Rate Variation Problem) and the extended problem, we propose algorithms based on BDP (Bounded Dynamic Programming).
