|
ИСТИНА |
Войти в систему Регистрация |
ИСТИНА ЦЭМИ РАН |
||
Notes on Complexity of the Simple Assembly Line Balancing Problemтезисы доклада
- Авторы: Лазарев А.А., Гафаров Е.Р., Долгий А.Б.
- Сборник: Труды и пленарные доклады участников конференции УКИ'12
- Тезисы
- Год издания: 2012
- Место издания: ИПУ РАН Москва
- Первая страница: 259
- Последняя страница: 266
- Аннотация: In this paper, we consider the assembly line balancing problem, for which it is necessary to minimize the number of used machine for a given cycle time. We propose a special case of the problem for which any Branch and Bound algorithm with any polynomial time computed Lower Bound can't solve some instances even for n=60 operations in appropriate time. Additionally, we analyze the worst maximal-station-load line balance and present a technique to reduce the graph of precedence relations that provides some advantages.
- Добавил в систему: Лазарев Александр Алексеевич