Semi-online scheduling on two identical machines with rejection

DOI10.1007/S10878-011-9435-XzbMath1282.90075OpenAlexW2076850149MaRDI QIDQ385491

Yu-Qing Wang, Min Jiang, Xiao Min, Jing Liu

Publication date: 2 December 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9435-x

zbMATH Keywords

competitive ratiobufferrejectionsemi-online schedulingreassignment

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Approximation algorithms for precedence-constrained identical machine scheduling with rejection ⋮ Online scheduling of unit jobs on three machines with rejection: a tight result

Cites Work

• Optimal semi-online algorithm for scheduling with rejection on two uniform machines
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Online scheduling with reassignment
• Preemptive scheduling with rejection
• On-line uniform machine scheduling with rejection
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Multiprocessor Scheduling with Rejection
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-online scheduling on two identical machines with rejection