Combining Simulation and Cutting Plane Methods in Service Systems

@inproceedings{Atlason2001CombiningSA,
  title={Combining Simulation and Cutting Plane Methods in Service Systems},
  author={J{\'u}l{\'i}us Atlason and Ul{\'i}us and Shane G. Henderson},
  year={2001}
}
In this paper we describe a method that combines simulation and cutting plane methods to solve resource allocation and scheduling problems. We solve a relaxed linear (integer) program iteratively and pass the solution of each iteration to a simulation. The results of the simulation are used to generate constraints in the linear (integer) program. We provide conditions under which the solution of the linear (integer) program converges to an optimal solution of the unrelaxed problem. The… CONTINUE READING
3 Extracted Citations
19 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 19 references

Convergence properties of two-stage stochastic programming

  • L. Dai, C. H. Chen, J. R. Birge
  • Journal of Optimization Theory and Applications…
  • 2000
Highly Influential
3 Excerpts

Jr

  • J. E. Kelley
  • The cutting-plane method for solving convex…
  • 1960
Highly Influential
3 Excerpts

Stochastic root finding via retrospective approximation

  • C. H. Chen, B. W. Schmeiser
  • IIE Transactions, 33 (3):259–275,
  • 2001
1 Excerpt

Optimal shift scheduling: A branch-and-price approach

  • A. Mehrotra, K. E. Murphy, M. A. Trick
  • Naval Research Logistics, 47(3):185–200,
  • 2000

Introduction to Stochastic Programming

  • J. R. Birge, F. Louveaux
  • Springer Series in Operations Research. Springer…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…