Component rationing for available-to-promise scheduling in configure-to-order systems

Ching Hua Chen-Ritzo, Tom Ervolina, Terry P. Harrison, Barun Gupta

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


We address the problem of rationing common components among multiple products in a configure-to-order system with order configuration uncertainty. The objective of this problem is to maximize expected revenue by implementing a threshold rationing policy. Under this policy, a product is available to promise if fulfilling the order for the product will not cause the inventory of any one of its required components to fall below the component's threshold level for that product. The problem is modeled as a two-stage stochastic integer program and solved using the sample average approximation approach. A heuristic is developed to generate good feasible solutions and lower bound estimates. Using industry data, we examine the benefit of component rationing as compared to a First-Come-First-Served policy and show that this benefit is correlated to the average revenue per product and the variability in the revenue across products whose components are constrained.

Original languageEnglish (US)
Pages (from-to)57-65
Number of pages9
JournalEuropean Journal of Operational Research
Issue number1
StatePublished - May 16 2011

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Component rationing for available-to-promise scheduling in configure-to-order systems'. Together they form a unique fingerprint.

Cite this