Abstract
Abstract: In this paper, we are going to overview a newvariant of the classical assignment problem referred to as the cyclic bottleneck assignment problem (CBAP). This problem can arise in the healthcare industry or supply chain management. The problem can arise in surgical room scheduling and can be described as follows. Each of m successive time units can be allocated to any of the m surgeonsavailable. The number of patients to be scheduled for surgery on a given unit and the length of stay of the patient in the recovery unit are dependent on the type of surgery. The problem is to assign one surgeon to each OR time so as to minimize the maximum number of patients that will be expected to occupy the recovery unit in the long run. In this paper we have compared various ways through which the CBAP has been solved , that is Cohort Intelligence[4] , Tabu Search[2] and Iterated Local Search
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
