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...
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Sciendo
2024-06-01
|
| Serie: | International Journal of Applied Mathematics and Computer Science |
| Soggetti: | |
| Accesso online: | https://doi.org/10.61822/amcs-2024-0017 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|