Authors: Erhan Kozan
This paper leads to significant improvement in intensive care units (ICU) operating efficiency and productivity by optimising scarce resources. Scheduling of patients in the ICU is complicated by the two general types; elective surgery and emergency arrivals. The job shop approach to reactive scheduling system for ICU promises considerable benefits over existing approaches, and allows problems of large size and complexity to be solved with great accuracy. A general parallel machine job shop model is proposed that fits uncertain arrivals with priorities and the allowance of rejection events at Intensive Care Units. An integer programming model is proposed to handle uncertain arrivals with priorities and while allowing rejections.