✦ LIBER ✦

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

✍ Scribed by K.S. Hindi

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 736 KB
Volume: 28
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(95)00021-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Network-based optimization algorithms fo

Network-based optimization algorithms for the capacitated multi-item lot sizing problem

✍ James R. Evans 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Algorithms for the multi-item multi-vehi

Algorithms for the multi-item multi-vehicles dynamic lot sizing problem

✍ Shoshana Anily; Michal Tzur 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

An efficient algorithm for the capacitat

An efficient algorithm for the capacitated single item dynamic lot size problem

✍ Ömer Kirca 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 713 KB

Multi-item capacitated lot-sizing proble

Multi-item capacitated lot-sizing problems with setup times and pricing decisions

✍ Mehmet Önal; H. Edwin Romeijn 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB

A new heuristic approach for the multi-i

A new heuristic approach for the multi-item dynamic lot sizing problem

✍ Ömer Kirca; Melih Kökten 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Strong turnpike policies in the single-i

Strong turnpike policies in the single-item capacitated lot-sizing problem with periodical dynamic parameter

✍ Stanislaw Bylka 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 1 views

This article considers optimization problems in a discrete capacitated lot sizing model for a single product with limited backlogging. The demand as well as the holding and backlogging costs are assumed to be periodical in time. Nothing is assumed about types of the cost functions. It is shown that