ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES

DOI10.1142/S1793830910000760zbMath1206.90045OpenAlexW2054163592MaRDI QIDQ3063612

Feifeng Zheng, Chengbin Chu, Ming Liu, Yin-Feng Xu

Publication date: 15 December 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830910000760

zbMATH Keywords

competitive analysismakespanonline schedulingbounded processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Cites Work

• Scheduling parallel jobs to minimize the makespan
• Online scheduling of parallel jobs on two machines is 2-competitive
• On-line scheduling of parallel jobs on two machines
• Bounds for Certain Multiprocessing Anomalies
• Unnamed Item

This page was built for publication: ONLINE SCHEDULING OF PARALLEL JOBS WITH BOUNDED PROCESSING TIMES ON TWO MACHINES