Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions
•Propose an online batch scheduling problem with periodic pulse interruptions.•Analyze the lower bounds on competitive ratios for the online problem.•Design the best possible online algorithms using a waiting strategy.•Prove the competitive ratios of the online algorithms. We consider an online sche...
Uložené v:
| Vydané v: | European journal of operational research Ročník 309; číslo 1; s. 53 - 64 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
16.08.2023
|
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | •Propose an online batch scheduling problem with periodic pulse interruptions.•Analyze the lower bounds on competitive ratios for the online problem.•Design the best possible online algorithms using a waiting strategy.•Prove the competitive ratios of the online algorithms.
We consider an online scheduling problem on identical batch machines to minimize the makespan with periodic pulse interruptions. Periodic pulse interruptions are machine unavailable intervals with negligible length and divide the scheduling horizon into available intervals. Jobs are released online over time and processed simultaneously as batches with the same processing times on identical batch machines. Every batch must be entirely processed in an available interval without any preemption. For unbounded machine capacity, we design best possible online algorithms with the competitive ratios of 1+η and 2m for a single machine (m=1) and m identical parallel machines (m≥2), respectively, where η≈0.8019 is the positive root of η3+2η2−η=1. For bounded machine capacity, we derive a best possible online algorithm with a competitive ratio of 1+η. |
|---|---|
| ISSN: | 0377-2217 1872-6860 |
| DOI: | 10.1016/j.ejor.2023.01.027 |