An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
We provide an efficient computational approach to solve the mixed integer programming (MIP) model developed by Tarim and Kingsman  for solving a stochastic lot-sizing problem with service level constraints under the static-dynamic uncertainty strategy. The effectiveness of the proposed method hinges on three novelties: (i) the proposed relaxation is computationally efficient and provides an optimal solution most of the time, (ii) if the relaxation produces an infeasible solution, then this solution yields a tight lower bound for the optimal cost, and (iii) it can be modified easily to obtain a feasible solution, which yields an upper bound. In case of infeasibility, the relaxation approach is implemented at each node of the search tree in a branch-and-bound procedure to efficiently search for an optimal solution. Extensive numerical tests show that our method dominates the MIP solution approach and can handle real-life size problems in trivial time.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Arthur M. Geoffrion, 1970. "Elements of Large-Scale Mathematical Programming Part I: Concepts," Management Science, INFORMS, vol. 16(11), pages 652-675, July.
- Tarim, S. Armagan & Smith, Barbara M., 2008. "Constraint programming for computing non-stationary (R,Â S) inventory policies," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1004-1021, September.
- James H. Bookbinder & Jin-Yan Tan, 1988. "Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints," Management Science, INFORMS, vol. 34(9), pages 1096-1108, September.
- Tempelmeier, Horst, 2007. "On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 181(1), pages 184-194, August.
- Vargas, Vicente, 2009. "An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model," European Journal of Operational Research, Elsevier, vol. 198(2), pages 447-451, October.
- Tarim, S. Armagan & Kingsman, Brian G., 2004. "The stochastic dynamic production/inventory lot-sizing problem with service-level constraints," International Journal of Production Economics, Elsevier, vol. 88(1), pages 105-119, March.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:215:y:2011:i:3:p:563-571. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.