✦ LIBER ✦

A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale

✍ Scribed by Hamid S. Mirmohammadi; Kourosh Eshghi

Book ID: 113553788
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 352 KB
Volume: 39
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2011.10.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic quantity discount lot size mod

A dynamic quantity discount lot size model with resales

✍ Kwon-Ik Sohn; Hark Hwang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 281 KB

This paper deals with a dynamic lot size problem in which the unit purchasing price depends on the quantity of an order and resale of the excess is possible at the end of each period. We assume an all units discount system with a single price break point. Investigation of the properties of an optima

A polynomial time algorithm to solve the

A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs

✍ Bertrand Hellion; Fabien Mangione; Bernard Penz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 547 KB

A cross entropy-Lagrangean hybrid algori

A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times

✍ M. Caserta; E. Quiñonez Rico 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 537 KB

A hybrid simulated annealing for the sin

A hybrid simulated annealing for the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and costs and dynamic release of jobs

✍ Mohammad Mirabi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 369 KB