Online scheduling to minimize the total weighted completion time plus the rejection cost

DOI10.1007/S10878-016-0083-ZMaRDI QIDQ2410099zbMATH OpenOpenAlexFDO

Authors Ran Ma, Jinjiang Yuan

Publication date 17 October 2017

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-016-0083-z

zbMATH Keywords

online algorithmsonline schedulingrejection costsingle machinetotal weighted completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on 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 semi-online algorithm for single machine scheduling with rejection
• Online scheduling with machine cost and rejection

Cites work

• 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 a single machine scheduling problem with bounded processing times
• A survey on offline scheduling with rejection
• An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
• Minimizing average completion time in the presence of release dates
• Multiprocessor Scheduling with Rejection
• 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
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
• Single machine scheduling with release dates
• Techniques for scheduling with rejection
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines

Cited in

(15)

• Large-scale medical examination scheduling technology based on intelligent optimization
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Single machine lot scheduling with optional job-rejection
• Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
• 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 machine cost and rejection
• A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
• Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
• Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
• An optimal online algorithm for scheduling with learning consideration
• A semi-online algorithm for single machine scheduling with rejection
• Minimizing weighted _p-norm of flow-time in the rejection model
• Online scheduling with rejection and withdrawal
• Online scheduling with linear deteriorating jobs to minimize the total weighted completion time

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

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