𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lot sizing and sequencing algorithm for dynamic demands upon a single facility

✍ Scribed by Ömer A. Aras; Lloyd A. Swanson

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
1000 KB
Volume
2
Category
Article
ISSN
0272-6963

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Demand shuffle—A method for multilevel p
Demand shuffle—A method for multilevel proportional lot sizing and scheduling
✍ A. Kimms 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

This contribution acquaints the reader with a model for multilevel single-machine proportional lot sizing and scheduling problems (PLSPs) that appear in the scope of short-term production planning. It is one of the first articles that deals with dynamic capacitated multilevel lot sizing and scheduli

An approximation algorithm for a facilit
An approximation algorithm for a facility location problem with stochastic demands and inventories
✍ A.F. Gabor; J.C.W. van Ommeren 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 176 KB

We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating