A semi-online algorithm for single machine scheduling with rejection
From MaRDI portal
Recommendations
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- Semi on-line scheduling on two identical machines with rejection
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines
- Semi-online scheduling on two identical machines with rejection
- scientific article; zbMATH DE number 6671683
Cites work
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- A semi-online algorithm and its competitive analysis for a single machine scheduling problem with bounded processing times
- An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
- 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
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Minimizing average completion time in the presence of release dates
- Multiprocessor Scheduling with Rejection
- On Submodular Search and Machine Scheduling
- On the parameterized tractability of single machine scheduling with rejection
- On-line scheduling of unit time jobs with rejection on uniform machines
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- On-line scheduling with rejection on identical parallel machines
- Online algorithms. The state of the art
- Online scheduling of ordered flow shops
- 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 to minimize the total weighted completion time plus the 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
- Parallel-machine scheduling with deteriorating jobs and rejection
- Parallel-machine scheduling with job-dependent cumulative deterioration effect and rejection
- Scheduling with rejection and a deteriorating maintenance activity on a single machine
- Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
- Single machine scheduling with release dates and rejection
Cited in
(10)- On the parameterized tractability of single machine scheduling with rejection
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown
- 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
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- Semi-online scheduling on two identical machines with rejection
- Optimal semi-online algorithm for scheduling with rejection on two uniform machines
- 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
This page was built for publication: A semi-online algorithm for single machine scheduling with rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024475)
