Abstract
We consider the problem or 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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call