✦ LIBER ✦

On formulations of the stochastic uncapacitated lot-sizing problem

✍ Scribed by Yongpei Guan; Shabbir Ahmed; Andrew J. Miller; George L. Nemhauser

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 207 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.05.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An -time algorithm for the stochastic un

An -time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times

✍ Ruiwei Jiang; Yongpei Guan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Performance of heuristics for the uncapa

Performance of heuristics for the uncapacitated lot-size problem

✍ Rita Vachani 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 749 KB

On stochastic lot-sizing problems with r

On stochastic lot-sizing problems with random lead times

✍ Kai Huang; Si̇mge Küçükyavuz 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A linear description of the discrete lot

A linear description of the discrete lot-sizing and scheduling problem

✍ Stan van Hoesel; Antoon Kolen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 632 KB

Computationally efficient solution of th

Computationally efficient solution of the multi-item, capacitated lot-sizing problem

✍ K.S. Hindi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 736 KB

On the discrete lot-sizing and schedulin

On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

✍ C. Gicquel; M. Minoux; Y. Dallery 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 714 KB

We consider the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs and times and propose solving it as a mixed-integer program using a commercial solver. Our approach is based on the extension of an existing tight formulation for the case without changeover times. Co