Online scheduling to minimize the total weighted completion time plus the rejection cost
From MaRDI portal
Publication:2410099
DOI10.1007/s10878-016-0083-zzbMath1382.90037OpenAlexW2526083655MaRDI QIDQ2410099
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
Related Items (8)
A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ Single machine lot scheduling with optional job-rejection ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ 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
Cites Work
- A better online algorithm for the parallel machine scheduling to minimize the total weighted completion time
- A survey on offline scheduling with rejection
- WSPT's competitive performance for minimizing the total weighted flow time: from single to parallel machines
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Scheduling-LPs bear probabilities. Randomized approximations for min-sum criteria
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- 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
- The power of \(\alpha\)-points in preemptive single machine scheduling.
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Single Machine Scheduling with Release Dates
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
This page was built for publication: Online scheduling to minimize the total weighted completion time plus the rejection cost
