IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v271y2018i3p1070-1084.html
   My bibliography  Save this article

Solution methods for the tray optimization problem

Author

Listed:
  • Dollevoet, Twan
  • van Essen, J. Theresia
  • Glorie, Kristiaan M.

Abstract

In order to perform medical surgeries, hospitals keep large inventories of surgical instruments. These instruments need to be sterilized before each surgery. Typically the instruments are kept in trays. Multiple trays may be required for a single surgery, while a single tray may contain instruments that are required for multiple surgical procedures. The tray optimization problem (TOP) consists of three main decisions: (i) the assignment of instruments to trays, (ii) the assignment of trays to surgeries, and (iii) the number of trays to keep in inventory. The TOP decisions have to be made such that total operating costs are minimized and such that for every surgery sufficient instruments are available. This paper presents and evaluates several exact and heuristic solution methods for the TOP. We compare solution methods on computation time and solution quality. Moreover, we conduct simulations to evaluate the performance of the solutions in the long run. The novel methods that are provided are the first methods that are capable of solving instances of realistic size. The most promising method consists of a highly scalable advanced greedy algorithm. Our results indicate that the outcomes of this method are, on average, very close to the outcomes of the other methods investigated, while it may be easily applied by (large) hospitals. The findings are robust with respect to fluctuations in long term OR schedules.

Suggested Citation

  • Dollevoet, Twan & van Essen, J. Theresia & Glorie, Kristiaan M., 2018. "Solution methods for the tray optimization problem," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1070-1084.
    • Handle: RePEc:eee:ejores:v:271:y:2018:i:3:p:1070-1084
    DOI: 10.1016/j.ejor.2018.05.051
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718304703
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.05.051?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Christian Hagist & Laurence Kotlikoff, 2005. "Who's Going Broke? Comparing Growth in Healthcare Costs in Ten OECD Countries," NBER Working Papers 11833, National Bureau of Economic Research, Inc.
    2. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    3. Reymondon, Francis & Pellet, Bertrand & Marcon, Eric, 2008. "Optimization of hospital sterilization costs proposing new grouping choices of medical devices into packages," International Journal of Production Economics, Elsevier, vol. 112(1), pages 326-335, March.
    4. Laurence J. Kotlikoff, 2005. "Who’s Going Broke? Comparing Growth in Healthcare Costs in Ten OECD Countries," Working Papers id:286, eSocialSciences.
    5. Muter, İbrahim & Birbil, Ş. İlker & Bülbül, Kerem, 2018. "Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows," European Journal of Operational Research, Elsevier, vol. 264(1), pages 29-45.
    6. Muter, İbrahim & İlker Birbil, Ş. & Bülbül, Kerem & Şahin, Güvenç, 2012. "A note on “A LP-based heuristic for a time-constrained routing problem”," European Journal of Operational Research, Elsevier, vol. 221(2), pages 306-307.
    7. Hanif D. Sherali & J. Cole Smith, 2001. "Improving Discrete Model Representations via Symmetry Considerations," Management Science, INFORMS, vol. 47(10), pages 1396-1407, October.
    8. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    9. Joris Klundert & Philippe Muls & Maarten Schadd, 2008. "Optimizing sterilization logistics in hospitals," Health Care Management Science, Springer, vol. 11(1), pages 23-33, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Amogh Bhosekar & Sandra Ekşioğlu & Tuğçe Işık & Robert Allen, 2023. "A discrete event simulation model for coordinating inventory management and material handling in hospitals," Annals of Operations Research, Springer, vol. 320(2), pages 603-630, January.
    2. Ehsan Ahmadi & Dale T. Masel & Seth Hostetler, 2023. "A Data-Driven Decision-Making Model for Configuring Surgical Trays Based on the Likelihood of Instrument Usages," Mathematics, MDPI, vol. 11(9), pages 1-26, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dollevoet, T.A.B. & van Essen, J.T. & Glorie, K.M., 2017. "Solution methods for the tray optimization problem," Econometric Institute Research Papers EI2017-16, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    3. An, Yu & Zhang, Yu & Zeng, Bo, 2015. "The reliable hub-and-spoke design problem: Models and algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 103-122.
    4. Tetiana Zatonatska & Olena Liashenko & Yana Fareniuk & Oleksandr Dluhopolskyi & Artur Dmowski & Marzena Cichorzewska, 2022. "The Migration Influence on the Forecasting of Health Care Budget Expenditures in the Direction of Sustainability: Case of Ukraine," Sustainability, MDPI, vol. 14(21), pages 1-17, November.
    5. Alexandre Belloni & Mitchell J. Lovett & William Boulding & Richard Staelin, 2012. "Optimal Admission and Scholarship Decisions: Choosing Customized Marketing Offers to Attract a Desirable Mix of Customers," Marketing Science, INFORMS, vol. 31(4), pages 621-636, July.
    6. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    7. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    8. Zhang, Zheng & Wei, Yongqi & Xiong, Youming & Peng, Geng & Wang, Guorong & Lu, Jingsheng & Zhong, Lin & Wang, Jingpeng, 2022. "Influence of the location of drilling fluid loss on wellbore temperature distribution during drilling," Energy, Elsevier, vol. 244(PB).
    9. Jabbarzadeh, Armin & Fahimnia, Behnam & Sheu, Jiuh-Biing & Moghadam, Hani Shahmoradi, 2016. "Designing a supply chain resilient to major disruptions and supply/demand interruptions," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 121-149.
    10. Junming Liu & Weiwei Chen & Jingyuan Yang & Hui Xiong & Can Chen, 2022. "Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 769-789, March.
    11. Springborn, Michael R., 2014. "Risk aversion and adaptive management: Insights from a multi-armed bandit model of invasive species risk," Journal of Environmental Economics and Management, Elsevier, vol. 68(2), pages 226-242.
    12. Li, Wenjie & Yang, Lixing & Wang, Li & Zhou, Xuesong & Liu, Ronghui & Gao, Ziyou, 2017. "Eco-reliable path finding in time-variant and stochastic networks," Energy, Elsevier, vol. 121(C), pages 372-387.
    13. Adam Diamant & Joseph Milner & Fayez Quereshy & Bo Xu, 2018. "Inventory management of reusable surgical supplies," Health Care Management Science, Springer, vol. 21(3), pages 439-459, September.
    14. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
    15. Andreea Claudia ȘERBAN & Mirela Ionela ACELEANU, 2015. "Current Demographic Trends – A New Challenge for the Labour Market," Theoretical and Applied Economics, Asociatia Generala a Economistilor din Romania - AGER, vol. 0(4(605), W), pages 309-320, Winter.
    16. Valeska Hofbauer-Milan & Stefan Fetzer & Christian Hagist, 2023. "How to Predict Drug Expenditure: A Markov Model Approach with Risk Classes," PharmacoEconomics, Springer, vol. 41(5), pages 561-572, May.
    17. Vasile BRÄ‚TIAN, 2018. "Portfolio Optimization. Application of the Markowitz Model Using Lagrange and Profitability Forecast," Expert Journal of Economics, Sprint Investify, vol. 6(1), pages 26-34.
    18. Miguel A. Lejeune & John Turner, 2019. "Planning Online Advertising Using Gini Indices," Operations Research, INFORMS, vol. 67(5), pages 1222-1245, September.
    19. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    20. Xie, Siyang & An, Kun & Ouyang, Yanfeng, 2019. "Planning facility location under generally correlated facility disruptions: Use of supporting stations and quasi-probabilities," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 115-139.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:271:y:2018:i:3:p:1070-1084. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.