装箱问题
调度(生产过程)
计算机科学
箱子
运筹学
分布式计算
数学优化
工业工程
工程类
算法
数学
作者
Jörg Reutershan,Christian Rupprecht,Thomas Rupprecht
标识
DOI:10.1016/j.bja.2024.03.006
摘要
Editor—Operating room (OR) scheduling is challenging and often referred to as playing Tetris® (at a high-end level). Algorithms have been widely used to optimise such challenges that are referred to as bin packing problems, that is, arranging objects of different sizes into a set of containers with a given capacity. Bin packing is one of the most often used models to optimise scheduling in a variety of applications. 1 Vijayakumar B. Parikh P.J. Scott R. Barnes A. Gallimore J. A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital. Eur J Oper Res. 2013; 224: 583-591 Google Scholar ,2 Park H.S. Kim S.H. Bong M.R. et al. Optimization of the operating room scheduling process for improving efficiency in a tertiary hospital. J Med Syst. 2020; 44: 171 Google Scholar
科研通智能强力驱动
Strongly Powered by AbleSci AI