On-line scheduling of unit time jobs with rejection on uniform machines

DOI10.1007/s11424-008-9070-5zbMath1193.68060OpenAlexW2072933730MaRDI QIDQ1031971

Shoupeng Liu, Yu-Zhong Zhang

Publication date: 23 October 2009

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-008-9070-5

zbMATH Keywords

competitive ratioon-line schedulinguniform machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection

Cites Work

• Unnamed Item
• Approximation algorithms in batch processing
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Minimizing mean completion time in a batch processing system
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: On-line scheduling of unit time jobs with rejection on uniform machines