|
A stochastic dynamic programming approach to revenue management in a make-to-stock production system
Quante, Rainer
;
Fleischmann, Moritz
;
Meyr, Herbert
|
URL:
|
https://ssrn.com/abstract=1365058
|
|
Dokumenttyp:
|
Arbeitspapier
|
|
Erscheinungsjahr:
|
2009
|
|
Titel einer Zeitschrift oder einer Reihe:
|
ERIM Report Series
|
|
Band/Volume:
|
09-015
|
|
Ort der Veröffentlichung:
|
Rotterdam ; Mannheim
|
|
Sprache der Veröffentlichung:
|
Englisch
|
|
Einrichtung:
|
Fakultät für Betriebswirtschaftslehre > ABWL u. Logistik (Fleischmann 2009-)
|
|
Fachgebiet:
|
330 Wirtschaft
|
|
Fachklassifikation:
|
JEL:
M11 , R4 , M , D24 , D46 , L23,
|
|
Freie Schlagwörter (Englisch):
|
make-to-stock production , advanced planning systems , order fulfillment , revenue management
|
|
Abstract:
|
In this paper, we consider a make-to-stock production system with known exogenous replenishments and multiple customer classes. The objective is to maximize profit over the planning horizon by deciding whether to accept or reject a given order, in anticipation of more profitable future orders. What distinguishes this setup from classical airline revenue management problems is the explicit consideration of past and future replenishments and the integration of inventory holding and backlogging costs. If stock is on-hand, orders can be fulfilled immediately, backlogged or rejected. In shortage situations, orders can be either rejected or backlogged to be fulfilled from future arriving supply. The described decision problem occurs in many practical settings, notably in make-to-stock production systems, in which production planning is performed on a mid-term level, based on aggregated demand forecasts. In the short term, acceptance decisions about incoming orders are then made according to stock on-hand and scheduled production quantities. We model this problem as a stochastic dynamic program and characterize its optimal policy. It turns out that the optimal fulfillment policy has a relatively simple structure and is easy to implement. We evaluate this policy numerically and find that it systematically outperforms common current fulfillment policies, such as first-come-first-served and deterministic optimization.
|
 | Dieser Eintrag ist Teil der Universitätsbibliographie. |
 Suche Autoren in
Sie haben einen Fehler gefunden? Teilen Sie uns Ihren Korrekturwunsch bitte hier mit: E-Mail
Actions (login required)
 |
Eintrag anzeigen |
|
|
