Zobrazeno 1 - 5
of 5
pro vyhledávání: '"lot sizing, dynamic programming"'
Autor:
Lbert P. M. Wagelmans, Dong X. Shaw
Publikováno v:
Management Science. 44:831-838
We consider the Capacitated Economic Lot Size Problem with piecewise linear production costs and general holding costs, which is an NP-hard problem but solvable in pseudo-polynomial time. A straightforward dynamic programming approach to this problem
We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalizatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______645::ff311187999a168f1693405b65a50d67
https://repub.eur.nl/pub/213/ERS-2002-059-LIS.pdf
https://repub.eur.nl/pub/213/ERS-2002-059-LIS.pdf
One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not allowed, then the demand of a given period cannot be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94923be5af534ff22b64ad621002b005
http://papers.tinbergen.nl/99095.pdf
http://papers.tinbergen.nl/99095.pdf
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Chien-Hua Mike Lin, Chia-Shin Chung
Publikováno v:
Management Science. 34:420-426
In this paper, we study a class of the capacitated dynamic lot size problem, where, over time, the setup costs are nonincreasing, the unit holding costs have arbitrary pattern, the unit production costs are nonincreasing and the capacities are nondec