Scheduling Surgeries for Patients Requiring Post-Operative Intensive Care: A Multiple Objective Integer Programming Approach

  • Harold P. Benson
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 5)

Abstract

One of the more challenging tasks at the Veteran’s Administration Hospital in Gainesville is that of scheduling patients for surgery. In this paper, we present a linear multiple objective integer programming model for scheduling surgeries at the VA which require post-operative intensive care. The model can also be used to explore the tradeoffs in the number of surgeries of this type that can be achieved. We also indicate how the model is used, and we provide some sample results which demonstrate the practicality and validity of the model.

Keywords

Objective Function Integer Programming Efficient Solution Surgical Intensive Care Unit Surgery Schedule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. S. Garfinkel and G. L. Nemhauser, Integer Programming, Wiley, New York, N.Y., 1972.Google Scholar
  2. [2]
    H. M. Salkin, Integer Programming, Addison-Wesley, Reading, Massachusetts, 1975.Google Scholar
  3. [3]
    G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley-Interscience, New York, N.Y., 1988.Google Scholar
  4. [4]
    J. P. Ignizio, Goal Programming and Extensions, D. C. Heath, Lexington, Massachusetts, 1976.Google Scholar
  5. [5]
    R. L. Keeney and H. Raiffa, Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York, N.Y., 1976.Google Scholar
  6. [6]
    H. W. Kuhn and A. W. Tucker, “Nonlinear Programming,” in: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, J. Neyman, ed., University of California Press, Berkeley, California, 1950, pp. 481–492.Google Scholar
  7. [7]
    G. R. Bitran, “Linear Multiple Objective Programs with Zero-One Variables,” Math. Programming, 13 (1977) 121–139.CrossRefGoogle Scholar
  8. [8]
    R. Banker, M. Guignard, and S. Gupta, “An Algorithm for Generating Efficient Solutions to the Multiple Objective Integer Programming Problem,” Applied Research Center, The Wharton School, University of Pennsylvania, Philadelphia, PA., December, 1978.Google Scholar
  9. [9]
    D. Klein and E. Hannan, “An Algorithm for the Multiple Objective Integer Programming Problem,” European J. Operation. Res., 9 (1982) 378–385.CrossRefGoogle Scholar
  10. [10]
    International Business Machines, Mathematical Programming System Extended (MPSX), Mixed Integer Programming (MIP) Program Description,IBM, White Plains, N.Y., 1973, 2nd edition.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Harold P. Benson
    • 1
    • 2
  1. 1.College of Business Administration University of FloridaGainesvilleUSA
  2. 2.Health Services Research and DevelopmentVA Medical CenterGainesvilleUSA

Personalised recommendations