✦ LIBER ✦

An efficient heuristic procedure for the single-item, discrete lot sizing problem

✍ Scribed by Cem Canel; Basheer M. Khumawala; Japhet S. Law

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 725 KB
Volume: 43
Category: Article
ISSN: 0925-5273
DOI: 10.1016/0925-5273(96)00032-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

Efficient post-optimization analysis pro

Efficient post-optimization analysis procedure for the dynamic lot-sizing problem

✍ Moustapha Diaby 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 288 KB

An efficient heuristic for the multi-ite

An efficient heuristic for the multi-item newsboy problem with a single constraint

✍ Steven Nahmias; Charles P. Schmidt 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 493 KB

This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more effici