Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan
Guardado en:
| Publicado en: | Journal of Combinatorial Optimization vol. 49, no. 1 (Jan 2025), p. 6 |
|---|---|
| Autor principal: | |
| Otros Autores: | , |
| Publicado: |
Springer Nature B.V.
|
| Materias: | |
| Acceso en línea: | Citation/Abstract Full Text Full Text - PDF |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3254699492 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 1382-6905 | ||
| 022 | |a 1573-2886 | ||
| 024 | 7 | |a 10.1007/s10878-024-01242-7 |2 doi | |
| 035 | |a 3254699492 | ||
| 045 | 2 | |b d20250101 |b d20250131 | |
| 100 | 1 | |a Zhang, Han |u Zhengzhou University, School of Mathematics and Statistics, Zhengzhou, People’s Republic of China (GRID:grid.207374.5) (ISNI:0000 0001 2189 3846) | |
| 245 | 1 | |a Online scheduling on an unbounded parallel-batch machine to minimize the weighted makespan | |
| 260 | |b Springer Nature B.V. |c Jan 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a In this paper we study the online over-time scheduling on an unbounded parallel-batch machine to minimize the weighted makespan. First, we show that the general problem has a low bound 2 and then design a 4-competitive online algorithm. Furthermore, we consider a special case in which the jobs have agreeable processing times and weights. When all jobs have the same weights (the task is to minimize the makespan), an online algorithm with the best possible competitive ratio 5+12≈1.618<inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="10878_2024_1242_Article_IEq1.gif" /> has been established in the literature. We show that, after a slightly modification, this known online algorithm also has the best possible competitive ratio 5+12≈1.618<inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="10878_2024_1242_Article_IEq2.gif" /> for our problem. Finally, we introduce limited restarts into the above special case and present an online algorithm with a better competitive ratio 117≈1.571<inline-graphic specific-use="web" mime-subtype="GIF" xlink:href="10878_2024_1242_Article_IEq3.gif" />. | |
| 653 | |a Schedules | ||
| 653 | |a Scheduling | ||
| 653 | |a Algorithms | ||
| 653 | |a Computer aided scheduling | ||
| 653 | |a Competition | ||
| 700 | 1 | |a Lu, Lingfa |u Zhengzhou University, School of Mathematics and Statistics, Zhengzhou, People’s Republic of China (GRID:grid.207374.5) (ISNI:0000 0001 2189 3846) | |
| 700 | 1 | |a Yuan, Jinjiang |u Zhengzhou University, School of Mathematics and Statistics, Zhengzhou, People’s Republic of China (GRID:grid.207374.5) (ISNI:0000 0001 2189 3846) | |
| 773 | 0 | |t Journal of Combinatorial Optimization |g vol. 49, no. 1 (Jan 2025), p. 6 | |
| 786 | 0 | |d ProQuest |t Science Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3254699492/abstract/embedded/J7RWLIQ9I3C9JK51?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text |u https://www.proquest.com/docview/3254699492/fulltext/embedded/J7RWLIQ9I3C9JK51?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3254699492/fulltextPDF/embedded/J7RWLIQ9I3C9JK51?source=fedsrch |