| Autor: |
Zhimeng Liu, Shuguang Li |
| Jazyk: |
angličtina |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Mathematical Biosciences and Engineering, Vol 19, Iss 7, Pp 7337-7348 (2022) |
| Druh dokumentu: |
article |
| ISSN: |
1551-0018 |
| DOI: |
10.3934/mbe.2022346?viewType=HTML |
| Popis: |
This paper studies the Pareto scheduling problem of minimizing total weighted completion time and maximum cost on a single machine. It is known that the problem is strongly NP-hard. Algorithms with running time $ O(n^3) $ are presented for the following cases: arbitrary processing times, equal release dates and equal weights; equal processing times, arbitrary release dates and equal weights; equal processing times, equal release dates and arbitrary weights. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
