On-line uniform machine scheduling with rejection
From MaRDI portal
Publication:1583671
zbMATH Open0958.90045MaRDI QIDQ1583671FDOQ1583671
Authors: R. Smith
Publication date: 30 October 2000
Published in: Computing (Search for Journal in Brave)
Recommendations
- A special case of on-line scheduling on two uniformly machines with rejection
- Uniform machine scheduling with arrival time and rejection
- On-line scheduling of unit time jobs with rejection on uniform machines
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- On-line scheduling with rejection on identical parallel machines
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cited In (16)
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
- Scheduling deteriorating jobs with rejection on dominant machines
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties
- Graph multi-coloring for a job scheduling application
- Scheduling linear deteriorating jobs with rejection on a single machine
- Bin packing problems with rejection penalties and their dual problems
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Scheduling with machine cost and rejection
- Scheduling with rejection and non-identical job arrivals
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Online scheduling with rejection and withdrawal
- Semi-online scheduling on two identical machines with rejection
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines
This page was built for publication: On-line uniform machine scheduling with rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583671)