17771

Автор(ы): 

Лазарев А. А. (ИПУ РАН, Лаборатория 68)
Carballo L. (Facultad de Ciencias, UAEM)
Vakhania N. (Facultad de Ciencias, UAEM)
Werner F. (?)

Автор(ов): 

4

Параметры публикации

Тип публикации: 

Доклад

Название: 

Search on the enumeration tree in the multiprocessor job-shop problem

Электронная публикация: 

Да

Наименование конференции: 

  • 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest, Romania)

Наименование источника: 

  • Proceedings of the 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest)

Город: 

  • Bucharest

Издательство: 

  • University Politehnica of Bucharest, CIMR Research Centre

Год издания: 

2012

Страницы: 

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.

Библиографическая ссылка: 

Лазарев А.А., Carballo L., Vakhania N., Werner F. Search on the enumeration tree in the multiprocessor job-shop problem / Proceedings of the 14th IFAC Symposium on Information Control Problems in Manufacturing (INCOM’12, Bucharest). Bucharest: University Politehnica of Bucharest, CIMR Research Centre, 2012. С. 381-386.