New Ideas in Lagrangian Relaxation for a Scheduling Problem with the weighted Tardiness Criterion

We consider an extension of Lagrangian relaxation methods for solving the total weighted tardiness scheduling problem on a single machine. First, we investigate a straightforward relaxation method and decompose it into upper and lower subproblems. For the upper subproblem we propose an alternative s...

Полное описание

Библиографические подробности

Главные авторы:	Rudy Jarosław, Idzikowski Radosław, Smutnicki Czesław, Banaszak Zbigniew, Bocewicz Grzegorz
Формат:	Artigo
Язык:	Inglês
Опубликовано:	Sciendo 2024-06-01
Серии:	International Journal of Applied Mathematics and Computer Science
Предметы:	lagrangian relaxation scheduling total weighted tardiness metaheuristics
Online-ссылка:	https://doi.org/10.61822/amcs-2024-0017
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!