A tight lower bound for job scheduling with cancellation

DOI10.1016/J.IPL.2005.09.001zbMATH Open1184.68142OpenAlexW2160705700MaRDI QIDQ1044744FDOQ1044744

Authors: Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. Fung, Chung Keung Poon, Yinfeng Xu 

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.001

Recommendations

• Computing and Combinatorics
• Online scheduling of parallel jobs on two machines is 2-competitive
• A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
• A tight lower bound for the completion time variance problem
• scientific article; zbMATH DE number 1834660

zbMATH Keywords

lower boundsschedulingon-line algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• On-line scheduling of jobs with fixed start and end times
• Computing and Combinatorics
• Scheduling broadcasts with deadlines

Cited In (4)

• Improved on-line broadcast scheduling with deadlines
• Computing and Combinatorics
• A near optimal scheduler for on-demand data broadcasts
• A lower bound for the job insertion problem.

This page was built for publication: A tight lower bound for job scheduling with cancellation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044744)