On-line uniform machine scheduling with rejection

zbMath0958.90045MaRDI QIDQ1583671

R. Smith

Publication date: 30 October 2000

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

competitive ratioworst-case analysison-line schedulinguniform machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (15)

Scheduling with machine cost and rejection ⋮ Semi-online scheduling on two identical machines with rejection ⋮ Preemptive online scheduling with rejection of unit jobs on two uniformly related machines ⋮ Graph multi-coloring for a job scheduling application ⋮ Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties ⋮ Optimal semi-online algorithm for scheduling with rejection on two uniform machines ⋮ Scheduling with rejection and non-identical job arrivals ⋮ Approximation algorithms for precedence-constrained identical machine scheduling with rejection ⋮ Online scheduling of unit jobs on three machines with rejection: a tight result ⋮ Online scheduling with rejection and withdrawal ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ Scheduling linear deteriorating jobs with rejection on a single machine ⋮ Bin packing problems with rejection penalties and their dual problems ⋮ Scheduling deteriorating jobs with rejection on dominant machines ⋮ A PTAS for parallel batch scheduling with rejection and dynamic job arrivals

This page was built for publication: On-line uniform machine scheduling with rejection