DANCEST 805 Lecture Notes - Lecture 13: Mathematical Model, Literature Review, Bin Packing Problem
Document Summary
Summary: dual bin-packing approach to scheduling surgical cases at a pubicly-funded hospital. 2 literature review: surgical case scheduling categorisation, 2 objectives: max utilization; min total cost, general assignment vs case sequencing, other approaches. Job shop: mixed integer linear programming, 2 stage stochastic mixed integer, etc. 4 a ffd-based heuristic: first fit decreasing algorithm, steps in heuristic, sort patients according to sequencing rule, start at top of list. Pick patient not flagged (could not be scheduled) or scheduled. If none found, exit: start from earliest available day and check if at least one surgeon available. if none found go on to next day, if none at all found, flag patient. Two cases having the same priority are sorted again according to one of the rules: 4. 2 assignment rule: assigns patients to a time-slots in the day depending on the following, surgeon availability and performance, availability of other resources.
