✦ LIBER ✦

A new dynamic programming algorithm for the single item capacitated dynamic lot size model

✍ Scribed by Hsin-Der Chen; Donald W. Hearn; Chung-Yee Lee

Publisher: Springer US
Year: 1994
Tongue: English
Weight: 662 KB
Volume: 4
Category: Article
ISSN: 0925-5001
DOI: 10.1007/bf01098363

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An effective algorithm for the capacitat

An effective algorithm for the capacitated single item lot size problem

✍ Chia-Shin Chung; James Flynn; Chien-Hua Mike Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

A dynamic programming algorithm for dyna

A dynamic programming algorithm for dynamic lot size models with piecewise linear costs

✍ Hsin-Der Chen; Donald W. Hearn; Chung-Yee Lee 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 830 KB

A heuristic procedure for a single-item

A heuristic procedure for a single-item dynamic lot sizing problem

✍ O.S. Benli; I. Sabuncuoglu; S. Tufekci 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 626 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

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