
: . ., . ., . ., . ., . ., . ., . ., . ., . .
:
: 63
:
: 2016
: . ., . ., . . . // . 63. .: , 2016. . 129154.
: , , ,
(.): scheduling theory, combinatorial optimization, planning, International Space Station
: . , . , .
(.): Astronauts training is a longterm, complex and expensive process that lasts from two to three years and require individual approach to each participant. The paper presents an attempt to formalize this process. We consider a set of related problems of the astronaut training scheduling. The first problem is to distribute qualifications for various onboard systems between astronauts, i.e. to determine the set of tasks for each astronaut. The second problem is to determine start moments for all considered tasks. For this issue a mathematical models based on integer linear programming and constraint programming are proposed. Computational results of the implemented models and experiments on real data are presented.
PDF 
: 1498, : 528, : 8.

© 2007.
 