Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost

DOI10.1016/j.ipl.2013.05.006zbMath1284.68091MaRDI QIDQ2444843

Jinjiang Yuan, Ran Ma

Publication date: 11 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.006

zbMATH Keywords

scheduling; online algorithms; total completion time; rejection

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

A Semi-Online Algorithm for Single Machine Scheduling with Rejection, Two-machine open-shop scheduling with rejection to minimize the makespan, New results on two-machine flow-shop scheduling with rejection, Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines, Parallel-machine scheduling with release dates and rejection, Online scheduling with linear deteriorating jobs to minimize the total weighted completion time, New approximation algorithms for machine scheduling with rejection on single and parallel machine, Scheduling problems with rejection to minimize the maximum flow time, Applying ``peeling onion approach for competitive analysis in online scheduling with rejection, Online scheduling to minimize the total weighted completion time plus the rejection cost, A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection

Cites Work

• Unnamed Item
• A survey on offline scheduling with rejection
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Scheduling linear deteriorating jobs with rejection on a single machine
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• Single machine scheduling with release dates and rejection
• Preemptive scheduling with rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Scheduling with machine cost and rejection
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Techniques for scheduling with rejection
• Multiprocessor Scheduling with Rejection
• Theory and Applications of Models of Computation
• Preemptive multiprocessor scheduling with rejection