Автор(ы): Гафаров Е. Р. (ИПУ РАН, Лаборатория 68)Долгий А. Б. (?)Автор(ов): 2 Параметры публикацииТип публикации: Статья в журнале/сборникеНазвание: Two-dedicated-machine scheduling problem with precedence relations to minimize makespanISBN/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.