Автор(ы): Лазарев А. А. (ИПУ РАН, Лаборатория 68)Гущина В. П. (ИПУ РАН, Лаборатория 68) НЕАКТУАЛЬНАЯ ЗАПИСЬАвтор(ов): 2 Параметры публикацииТип публикации: Тезисы докладаНазвание: ISS team scheduling problemISBN/ISSN: 978-5-91601-099-2Наименование конференции: 5th International conference "Optimization and Applications" (Optima-2014, Petrovac, Montenegro)Наименование источника: Abstracts of the 5th International conference "Optimization and Applications" (Optima-2014, Petrovac, Montenegro)Город: МоскваИздательство: ВЦ им. А.А.Дородницына РАНГод издания: 2014Страницы: 123-124 АннотацияWe consider the problem of planning the cousmonaut's time in ISS with given set of tasks, time planning horizon and load constraints. Shown that the problem is NP-hard in a strong sense. The heuristic algorithm was proposed. Proved that proposed algorithm is exact for problem with requirement of performing all tasks. Program C++ was written and algorithm's work was qualitatively analyzed. Библиографическая ссылка: Лазарев А.А., Гущина В.П. ISS team scheduling problem / Abstracts of the 5th International conference "Optimization and Applications" (Optima-2014, Petrovac, Montenegro). М.: ВЦ им. А.А.Дородницына РАН, 2014. С. 123-124.