|
Дискретная математика и математическая кибернетика
Minimizing total completion time on parallel machines with unit length jobs that need one additional resource
V. A. Strusevich Sherwood Road, Welling, Kent, DA16 2SJ, U.K.
Аннотация:
The paper considers a scheduling problem on parallel identical machines to minimize the sum of the completion times. All jobs are of unit length and require one unit of one of the additional resources. We offer an algorithm that is much faster and simpler than previously available.
Ключевые слова:
resource constrained scheduling, unit length jobs, total completion time, parallel identical machines.
Поступила 27 апреля 2022 г., опубликована 30 августа 2022 г.
Образец цитирования:
V. A. Strusevich, “Minimizing total completion time on parallel machines with unit length jobs that need one additional resource”, Сиб. электрон. матем. изв., 19:2 (2022), 601–612
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/semr1524 https://www.mathnet.ru/rus/semr/v19/i2/p601
|
|