摘要:The problem of planning the work of operating departments with scheduled admissions of patients is investigated. Two models are constructed: with and without anesthesiologists. Approximate algorithms were developed for each model. All experiments were performed on real, high-dimensional data. The resulting solutions satisfy the hospital's requirements for accuracy and speed.
关键词:approximation algorithms;decomposition;capacity increase;scheduling problem