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...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 309; číslo 1; s. 53 - 64
Hlavní autori:	Lin, Ran, Wang, Jun-Qiang, Liu, Zhixin, Xu, Jun
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.08.2023
Predmet:	Competitive ratio Identical batch machines Online algorithm Periodic pulse interruption Scheduling Periodic pulse interruption Scheduling Online algorithm Competitive ratio Identical batch machines
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!