A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems

A bounded dynamic programming solution to the batching problem in mixed-model just-in-time manufacturing systems

0.00 Avg rating0 Votes
Article ID: iaor20071159
Country: Netherlands
Volume: 103
Issue: 2
Start Page Number: 841
End Page Number: 862
Publication Date: Jan 2006
Journal: International Journal of Production Economics
Authors: ,
Keywords: programming: dynamic
Abstract:

The batch production smoothing problem (BPSP) aims at finding appropriate batch sizes for a variety of products and sequencing the batches in such a way that their appearances are uniformly dispersed over the planning horizon. Extending the previous research work on the BPSP, this paper introduces a bounded dynamic programming (BDP) approach. Computational experiments prove that the BDP approach reduces the computational time needed to solve the problem significantly and allows larger-size problems to be solved within practical times.

Reviews

Required fields are marked *. Your email address will not be published.