On-line scheduling with rejection on identical parallel machines

DOI10.1007/s11424-006-0431-7zbMath1115.68040OpenAlexW2088096868MaRDI QIDQ882532

Cuixia Miao, Yu-Zhong Zhang

Publication date: 24 May 2007

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

Full work available at URL: https://doi.org/10.1007/s11424-006-0431-7

zbMATH Keywords

competitive ratioon-line algorithmidentical parallel machinesrejection penalty

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ 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
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Preemptive multiprocessor scheduling with rejection

This page was built for publication: On-line scheduling with rejection on identical parallel machines