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.006MaRDI QIDQ2444843zbMATH OpenOpenAlexFDO

Authors Ran Ma, Jinjiang Yuan

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

online algorithmsrejectionschedulingtotal completion time

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
• Online scheduling with machine cost and rejection
• A semi-online algorithm for single machine scheduling with rejection
• Online scheduling to minimize the total weighted completion time plus the rejection cost
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• On-line uniform machine scheduling with rejection
• An optimal online algorithm for single machine scheduling to minimize total general completion time
• On-line single machine scheduling with release dates and submodular rejection penalties
• An online algorithm for hierarchical scheduling on two identical machines with rejection
• On-line scheduling of unit time jobs with rejection on uniform machines

Cites work

• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• A survey on offline scheduling with rejection
• Bounded single-machine parallel-batch scheduling with release dates and rejection
• scientific article; zbMATH DE number 1094690 (Why is no real title available?)
• Multiprocessor Scheduling with Rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive multiprocessor scheduling with rejection
• Preemptive scheduling with rejection
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling with machine cost and rejection
• Single machine scheduling with release dates and rejection
• Techniques for scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Theory and Applications of Models of Computation

Cited in

(15)

• Scheduling problems with rejection to minimize the maximum flow time
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Scheduling with machine cost and rejection
• Online scheduling to minimize the total weighted completion time plus the rejection cost
• Online scheduling with machine cost and rejection
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem 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
• A semi-online algorithm for single machine scheduling with rejection
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
• Fair repetitive interval scheduling
• New approximation algorithms for machine scheduling with rejection on single and parallel machine

This page was built for publication: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444843)