25259

Автор(ы): 

Автор(ов): 

2

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

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

Статья в журнале/сборнике

Название: 

Two-dedicated-machine scheduling problem with precedence relations to minimize makespan

ISBN/ISSN: 

1862-4472

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

  • Optimization Letters

Обозначение и номер тома: 

Vol. 7

Город: 

  • Berlin

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

  • Springer-Verlag Berlin

Год издания: 

2013

Страницы: 

DOI 10.1007/s11590-013-0671-0
Аннотация
Two-dedicated-parallel-machine scheduling problem with precedence constraints to minimize make span is considered. This problem originally appeared as a sub-problem in assembly line balancing but it has also its own applications. Complexity and approximation results for this scheduling problem and its special cases with chains of jobs or equal-processing-times are presented.

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

Гафаров Е.Р., Долгий А.Б. Two-dedicated-machine scheduling problem with precedence relations to minimize makespan // Optimization Letters. 2013. Vol. 7. С. DOI 10.1007/s11590-013-0671-0.