68496

Автор(ы): 

Автор(ов): 

2

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

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

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

Название: 

On lower and upper bounds for single machine parallel batch scheduling

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

Да

ISBN/ISSN: 

1862-4480

DOI: 

10.1007/s11590-022-01857-x

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

  • Optimization letters

Город: 

  • Дордрехт

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

  • Springer

Год издания: 

2022

Страницы: 

https://link.springer.com/article/10.1007/s11590-022-01857-x
Аннотация
In this paper, we consider a single machine parallel batch scheduling problem subject to chains of jobs. We present polynomial lower and upper bounds as well as their experimental comparison and relative errors. According to the results of the numerical experiment, the relative difference between upper and lower bounds does not exceed 1.5.

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

Гафаров Е.Р., Долгий А.Б. On lower and upper bounds for single machine parallel batch scheduling // Optimization letters. 2022. С. https://link.springer.com/article/10.1007/s11590-022-01857-x.