Optimal semi-online algorithm for scheduling with rejection on two uniform machines

DOI10.1007/s10878-010-9316-8zbMath1236.90055OpenAlexW2070722664MaRDI QIDQ411229

Xiao Min, Jing Liu, Yu-Qing Wang

Publication date: 4 April 2012

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

Full work available at URL: https://doi.org/10.1007/s10878-010-9316-8

zbMATH Keywords

schedulingcompetitive ratiorejectionsemi-online algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Semi-online scheduling on two identical machines with rejection ⋮ Semi-online scheduling: a survey ⋮ Online scheduling of unit jobs on three machines with rejection: a tight result

Cites Work

• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• 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
• Randomized on-line scheduling on two uniform machines
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal semi-online algorithm for scheduling with rejection on two uniform machines