|
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
Search on the enumeration tree in the multiprocessor job-shop problemтезисы доклада
- Авторы: Лазарев А.А., Carballo L., Vakhania N., Werner F.
- Сборник: Proceedings of the 14th Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest, Romania)
- Тезисы
- Год издания: 2012
- Место издания: Bucharest
- Первая страница: 381
- Последняя страница: 386
- Аннотация: We present an approach based on a two-stage ltration of the set of feasible solutions for the multiprocessor job-shop scheduling problem. On the rst stage we use extensive dominance relations, whereas on the second stage we use lower bounds. We show that several lower bounds can eciently be obtained and implemented.
- Добавил в систему: Лазарев Александр Алексеевич