Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Techniques for Average Completion Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of jobs with favorite machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs with rejection on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shared processor scheduling of multiprocessor jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of unit jobs on three machines with rejection: a tight result / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Submodular Search and Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Known Arrival Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized tractability of single machine scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal on-line algorithms for single-machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive snoopy caching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of ordered flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of parallel machines to minimize total completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection on uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of on-line scheduling algorithms to minimize total completion time / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling to minimize the total weighted completion time plus the rejection cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and Algorithms for Stochastic Online Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling with rejection on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling problems with flexible release dates: applications to infrastructure restoration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing average completion time in the presence of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with soft precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with release dates and rejection / rank
 
Normal rank

Latest revision as of 21:05, 25 July 2024

scientific article
Language Label Description Also known as
English
Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection
scientific article

    Statements

    Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (English)
    0 references
    0 references
    0 references
    3 June 2021
    0 references
    scheduling
    0 references
    online algorithm
    0 references
    competitive ratio
    0 references
    parallel machines
    0 references
    rejection
    0 references
    0 references

    Identifiers