Solving the ORVP with preservation of the production mix using BDP.
Document typeConference report
Rights accessOpen Access
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).
CitationBautista, J.; Alfaro, R.; Cano, A. Solving the ORVP with preservation of the production mix using BDP.. A: International Conference on Industrial Engineering and Industrial Management. "Book of full papers. Libro de comunicaciones: 6th International Conference on Industrial Engineering and Industrial Management: XVI Congreso de Ingeniería de Organización". Vigo: 2012, p. 1554-1561.