Postponable Acceptance and Assignment: A Stochastic Dynamic Programming Approach

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 76
  • Download : 0
We study a new dynamic order acceptance and assignment problem of a make-to-order manufacturing or service system that produces heterogeneous products or services using heterogeneous servers. Unlike traditional dynamic order acceptance and assignment problems, in our settings the system can strategically postpone acceptance and assignment decisions for orders in hand. The system does this while waiting for more profitable orders to come and/or more productive servers to become available, with the risk of losing orders in hand, low server utilization, and high waiting penalties. We formulate this problem as a stochastic dynamic program, characterize the structure of the optimal policy, and discuss managerial insights gained from the optimal policy. The paper also provides a methodological contribution by finding general structural properties and their preservation conditions, which can be reused in related future operations management studies.
Publisher
INFORMS
Issue Date
2016
Language
English
Article Type
Article
Citation

M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, v.18, no.4, pp.493 - 508

ISSN
1523-4614
DOI
10.1287/msom.2016.0581
URI
http://hdl.handle.net/10203/250182
Appears in Collection
MT-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0