Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
From MaRDI portal
Publication:2029304
DOI10.1016/j.ejor.2020.08.009zbMath1487.90305OpenAlexW3048866006MaRDI QIDQ2029304
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.08.009
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
Single machine scheduling with rejection and generalized parameters ⋮ Single machine scheduling with rejection to minimize the weighted makespan ⋮ A best possible algorithm for an online scheduling problem with position-based learning effect ⋮ Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost ⋮ Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan ⋮ Order acceptance and scheduling with delivery under generalized parameters ⋮ A best possible online algorithm for minimizing the total completion time and the total soft penalty cost ⋮ An optimal online algorithm for single-processor scheduling problem with learning effect ⋮ An Optimal Online Algorithm for Scheduling with Learning Consideration ⋮ A Semi-Online Algorithm for Single Machine Scheduling with Rejection
Cites Work
- Unnamed Item
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel 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
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Scheduling linear deteriorating jobs with rejection on a single machine
- On-line scheduling of parallel machines to minimize total completion times
- On-line scheduling of unit time jobs with rejection on uniform machines
- Single machine scheduling with release dates and rejection
- Competitive snoopy caching
- Minimizing average completion time in the presence of release dates
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Online scheduling problems with flexible release dates: applications to infrastructure restoration
- A class of on-line scheduling algorithms to minimize total completion time
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Online scheduling of ordered flow shops
- On the parameterized tractability of single machine scheduling with rejection
- Shared processor scheduling of multiprocessor jobs
- Machine scheduling with soft precedence constraints
- Online scheduling of jobs with favorite machines
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Approximation Techniques for Average Completion Time Scheduling
- Online Scheduling with Known Arrival Times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Optimal on-line algorithms for single-machine scheduling
- Multiprocessor Scheduling with Rejection
- On Submodular Search and Machine Scheduling
- Models and Algorithms for Stochastic Online Scheduling
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
- Preemptive multiprocessor scheduling with rejection
This page was built for publication: Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
