AN EMPIRICAL STUDY OF THREE PACKING HEURISTICS FOR BINS WITH ADJUSTABLE CAPACITY – AN APPLICATION TO OPERATING ROOM SCHEDULING

摘要

Using simulation, we compare three offline packing heuristics for adjustable-size bins, a problem derived from operating room scheduling, on 500 days of generated data using different cost structures. Unlike classical bin-packing studies, we found that next-fit-decreasing is the best performing method.