VI International Conference on Optimization Methods and Applications "Optimization and applications" (OPTIMA-2015), Petrovac, Montenegro, September 2015
We consider the problem of planning the ISS cosmonaut training with different objectives. A pre-defined set of minimum qualification levels should be distributed between the crew members with minimum training time differences, training expenses or a maximum of the training level with a limitation of the budget. First, a description of the cosmonaut training process is given. The model are considered for the volume planning problem. The objective of the model is to minimize the differences between the total time of the preparation of all crew members. Then two models are considered for the timetabling planning problem. For the volume planning problem, two algorithms are presented. The first one is aheuristic with a complexity of O(n) operations. The second one consists of a heuristic and exact parts, and it is based on the npartition problem approach.
A railway connection of two stations by a single railway track is usually found on branch lines of railway network and is very common in various manufacturing supply chains. Our paper isДля книг на иностранных языках concerned with a scheduling problem for two stations with a single railway track with one siding. On single-track railway sidings or passing loops are used to increase the capacity of the line. In our paper we developed exact optimization algorithm by analysing the structure of optimal schedule for the proposed model. The algorithm produces a schedule that completes all transportations between two stations at minimal time. We present algorithm to construct an optimal schedule in O(1) operations. Optimal schedule analyse allows the development of exact optimization algorithms with other models and objective functions, i.e. results can be generalized and used in future work for a number of regular objective functions, commonly used in scheduling.