Minimization of the Weighted Total Sparsity of Cosmonaut Training Courses
The paper is devoted to a cosmonaut training planning problem, which is some kind of resource-constrained project scheduling problem (RCPSP) with a new goal function. Training of each cosmonaut is divided into special courses. To avoid too sparse courses, we introduce a special objective function—the weighted total sparsity of training courses. This non-regular objective function requires the development of new methods that differ from methods for solving the thoroughly studied RCPSP with the makespan criterion. New heuristic algorithms for solving this problem are proposed. Their efficiency is verified on real-life data. In a reasonable time, the algorithms let us find a solution that is better than the solution found with the help of the solver CPLEX CP Optimizer.
KeywordsResource-constrained project scheduling problem Heuristic algorithms Planning Priority rule
- 1.Artigues, C., Demassey, S., Neron, E. (eds.): Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. Wiley-ISTE, Hoboken-London (2008)Google Scholar
- 9.Lazarev, A.A., et al.: Mathematical modeling of the astronaut training scheduling. UBS 63, 129–154 (2016)Google Scholar
- 12.IBM Homepage. https://www.ibm.com/analytics/data-science/prescriptive-analytics/cplex-cp-optimizer. Accessed 1 July 2018
- 13.IBM Homepage. https://www.ibm.com/analytics/data-science/prescriptive-analytics/optimization-modeling. Accessed 1 July 2018