Optimal setup time reduction for a single product with dynamic demands

Optimal setup time reduction for a single product with dynamic demands

0.00 Avg rating0 Votes
Article ID: iaor19981624
Country: Netherlands
Volume: 85
Issue: 3
Start Page Number: 532
End Page Number: 540
Publication Date: Sep 1995
Journal: European Journal of Operational Research
Authors:
Keywords: programming: dynamic
Abstract:

We consider the problem of reducing setup times for the dynamic lot-sizing problem. We explicitly consider setup times and setup reduction costs. A dynamic programming procedure is proposed for solving the problem. Explicit expressions are given for the two types of setup reduction cost functions that are commonly studied in the setup reduction literature (the logarithmic and the power cost functions). A numerical example is provided.

Reviews

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