Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование
An industrial robot is to perform n tasks, Each task will be executed by exactly one of robot's m grabs. Precedence relations are given by a finite directed acyclic graph such that some tasks can be performed only after other tasks have been completed. The problem is to find a sequence of tasks which fits the precedence relations and minimizes the number of grab's changes, The problem is shown to be NP-hard and a polynomial algorithm for a special case including the two-grab-problem is presented.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 597-605 |
Число страниц | 9 |
Журнал | Optimization |
Том | 16 |
Номер выпуска | 4 |
DOI | |
Состояние | Опубликовано - 1 янв 1985 |
ID: 54298162