In the paper, we consider the NP-hard total tardiness minimization on a single machine scheduling problem. We propose a metric for that problem and present a new polynomial approximation scheme based on search for the polynomially solvable instance which has a minimal distance in the metric from an initial instance.
We consider the dynamic patient scheduling for the hospital surgery department with electronic health records. Models for increasing the throughput of the surgery are proposed. It is based on classical intellectual optimization problems, such as the assignment problem, the scheduling problem, and the forecasting problem. Various approaches to solving the proposed problem are investigated. The formalization of the surgery planning problem of the large medical hospital surgery department is considered.