✦ LIBER ✦

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

✍ Scribed by Ömer Kirca

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 713 KB
Volume: 45
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(90)90152-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An efficient algorithm for the dynamic e

An efficient algorithm for the dynamic economic lot size problem

✍ B. Golany; R. Maman; M. Yadin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 884 KB

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

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

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