A Mathematical Model for the Astronaut Training Scheduling Problem
We consider a problem of the astronaut training scheduling. Each astronaut has his own set of tasks which should be performed with respect to resource and time constraints. The problem is to determine start moments for all considered tasks. For this issue a mathematical model based on integer linear programming is proposed. Computational results of the implemented model and experiments on real data are presented.