𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Shoshana Anily; Michal Tzur

Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
133 KB
Volume
53
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

An optimal procedure for the coordinated
An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts
✍ Chia-Shin Chung; Sin-Hoon Hum; Omer Kirca πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 99 KB πŸ‘ 1 views

We consider in this paper the coordinated replenishment dynamic lot-sizing problem when quantity discounts are offered. In addition to the coordination required due to the presence of major and minor setup costs, a separate element of coordination made possible by the offer of quantity discounts nee

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