| Autor: |
Liu Xinbo, Wang Wen, Chen Xin, Sterna Malgorzata, Blazewicz Jacek |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
International Journal of Applied Mathematics and Computer Science, Vol 33, Iss 2, Pp 285-295 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2083-8492 |
| DOI: |
10.34768/amcs-2023-0021 |
| Popis: |
We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
