Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection
type: Item
instance of: scholarly article
title: Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection
zbMATH Open document ID: 1487.90305
author: Ran Ma
author: Sainan Guo
published in: European Journal of Operational Research
publication date: 2021-06-03T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 7354578
zbMATH Keywords: scheduling
zbMATH Keywords: online algorithm
zbMATH Keywords: competitive ratio
zbMATH Keywords: parallel machines
zbMATH Keywords: rejection
MaRDI profile type: Publication
full work available at URL: j.ejor.2020.08.009
OpenAlex ID: W3048866006
cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
cites work: Multiprocessor Scheduling with Rejection
cites work: Approximation techniques for average completion time scheduling
cites work: Online scheduling of jobs with favorite machines
cites work: Scheduling linear deteriorating jobs with rejection on a single machine
cites work: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
cites work: Shared processor scheduling of multiprocessor jobs
cites work: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
cites work: Online scheduling of unit jobs on three machines with rejection: a tight result
cites work: On Submodular Search and Machine Scheduling
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Online Scheduling with Known Arrival Times
cites work: On the parameterized tractability of single machine scheduling with rejection
cites work: Optimal on-line algorithms for single-machine scheduling
cites work: Competitive snoopy caching
cites work: Online scheduling of ordered flow shops
cites work: Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
cites work: On-line scheduling of parallel machines to minimize total completion times
cites work: On-line scheduling of unit time jobs with rejection on uniform machines
cites work: A class of on-line scheduling algorithms to minimize total completion time
cites work: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
cites work: Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
cites work: Online scheduling to minimize the total weighted completion time plus the rejection cost
cites work: Models and Algorithms for Stochastic Online Scheduling
cites work: On-line scheduling with rejection on identical parallel machines
cites work: Online scheduling problems with flexible release dates: applications to infrastructure restoration
cites work: Minimizing average completion time in the presence of release dates
cites work: Preemptive multiprocessor scheduling with rejection
cites work: Q4368485
cites work: Machine scheduling with soft precedence constraints
cites work: Single machine scheduling with release dates and rejection
DOI: 10.1016/J.EJOR.2020.08.009
Recommended article: A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
Recommended article: A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio
Recommended article: A New Approach to Online Scheduling
Recommended article: Online scheduling with rejection and reordering: exact algorithms for unit size jobs
Recommended article: Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
Recommended article: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
Recommended article: Q5197263
Recommended article: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
Recommended article: A survey on offline scheduling with rejection
Recommended article: On-line scheduling with rejection on identical parallel machines
description: scientific article; zbMATH DE number 7354578