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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 309; no. 1; pp. 53 - 64
Main Authors:	Lin, Ran, Wang, Jun-Qiang, Liu, Zhixin, Xu, Jun
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.08.2023
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!