A Semi-Online Algorithm for Single Machine Scheduling with Rejection
From MaRDI portal
Publication:5024475
DOI10.1142/S0217595921400030zbMath1481.90171OpenAlexW3129178243MaRDI QIDQ5024475
Sainan Guo, Ran Ma, Baoqiang Fan, Yu-Zhong Zhang
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595921400030
Related Items (1)
Cites Work
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- Parallel-machine scheduling with deteriorating jobs and rejection
- On-line scheduling with rejection on identical parallel machines
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- 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
- On-line scheduling of unit time jobs with rejection on uniform machines
- Single machine scheduling with release dates and rejection
- Online algorithms. The state of the art
- Minimizing average completion time in the presence of release dates
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- An exact composite lower bound strategy for the resource-constrained project scheduling problem
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Online scheduling of ordered flow shops
- On the parameterized tractability of single machine scheduling with rejection
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Multiprocessor Scheduling with Rejection
- Scheduling with Rejection and a Deteriorating Maintenance Activity on a Single Machine
- On Submodular Search and Machine Scheduling
This page was built for publication: A Semi-Online Algorithm for Single Machine Scheduling with Rejection
