Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines

DOI10.1007/S40305-015-0093-ZMaRDI QIDQ290334zbMATH OpenOpenAlexFDO

Authors Ran Ma, Jinjiang Yuan

Publication date 1 June 2016

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40305-015-0093-z

zbMATH Keywords

online algorithmsschedulingrejectiontotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling to minimize the total weighted completion time plus the rejection cost
• On-line scheduling with rejection on identical parallel machines
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• A special case of on-line scheduling on two uniformly machines with rejection

Cites work

• Multiprocessor Scheduling with Rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Preemptive multiprocessor scheduling with rejection
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling with machine cost and rejection

Cited in

(14)

• Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
• On-line scheduling with rejection on identical parallel machines
• Online scheduling to minimize the total weighted completion time plus the rejection cost
• Parameter learning online algorithm for multiprocessor scheduling with rejection
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• Online scheduling with machine cost and rejection
• A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
• Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode
• Scheduling with machine cost and rejection
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Online scheduling with rejection and withdrawal
• Scheduling with rejection to minimize the total weighted completion time
• Online parallel-machine scheduling in KRT environment to minimize total weighted completion time

This page was built for publication: Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines

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