We present a sequencing problem given on JIT (Just In Time) manufa c- turing env i ronments, with the objective of minimizing the variation of production rates ( ORV : Ou t put Rate Variation). We propose an extension of this problem based on t o r e quire, to the sequences, the preservation of the production mix throughout the manufa c turing of the products. To solve the ORVP (Output Rate Variation Problem) and the extended problem, we propose algorithms based on BDP ( Bounded Dynamic Progra m ming).