Preemptive multiprocessor scheduling with rejection
From MaRDI portal
Recommendations
- Multiprocessor Scheduling with Rejection
- scientific article; zbMATH DE number 871904
- Preemptive scheduling with rejection
- scientific article; zbMATH DE number 1670665
- From preemptive to non-preemptive scheduling using rejections
- Preemptive Scheduling of Parallel Jobs on Multiprocessors
- scientific article; zbMATH DE number 871911
- Preemptive scheduling with deadlines on parallel machines
- Preemptive Scheduling of Uniform Processor Systems
Cites work
- A Better Algorithm for an Ancient Scheduling Problem
- A better lower bound for on-line scheduling
- A lower bound for randomized on-line multiprocessor scheduling
- A lower bound for randomized on-line scheduling algorithms
- An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling
- An optimal algorithm for preemptive on-line scheduling
- Better Bounds for Online Scheduling
- Competitive snoopy caching
- scientific article; zbMATH DE number 4130003 (Why is no real title available?)
- Multiprocessor Scheduling with Rejection
- New algorithms for an ancient scheduling problem.
- New lower and upper bounds for on-line scheduling
- Randomized algorithms for that ancient scheduling problem
- Scheduling with deadlines and loss functions
- Techniques for scheduling with rejection
Cited in
(59)- Bounded single-machine parallel-batch scheduling with release dates and rejection
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- On-line scheduling of unit time jobs with rejection on uniform machines
- Single machine scheduling with release dates and rejection
- Graph multi-coloring for a job scheduling application
- Scheduling problems with rejection to minimize the maximum flow time
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Order acceptance and scheduling with machine availability constraints
- Minimizing the makespan on a single parallel batching machine
- Two-agent scheduling with rejection on a single machine
- The online \(k\)-server problem with rejection
- Rent or buy problems with a fixed time horizon
- Online file caching with rejection penalties
- Scheduling with machine cost and rejection
- Separating online scheduling algorithms with the relative worst order ratio
- Scheduling with rejection and non-identical job arrivals
- 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
- Bin packing problems with rejection penalties and their dual problems
- An improved heuristic for parallel machine scheduling with rejection
- Scheduling with partial rejection
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- scientific article; zbMATH DE number 1670665 (Why is no real title available?)
- Two-machine open-shop scheduling with rejection to minimize the makespan
- New results on two-machine flow-shop scheduling with rejection
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines
- Parallel-machine scheduling with release dates and rejection
- On variants of file caching
- Scheduling deteriorating jobs on a single machine with release times and rejection
- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
- Parameter learning online algorithm for multiprocessor scheduling with rejection
- Scheduling deteriorating jobs with rejection on dominant machines
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- scientific article; zbMATH DE number 871904 (Why is no real title available?)
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Multiprocessor Scheduling with Rejection
- Order acceptance and scheduling with consideration of service level
- TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
- On-line single machine scheduling with release dates and submodular rejection penalties
- Online scheduling with rejection and withdrawal
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- Parallel-machine scheduling with deteriorating jobs and rejection
- Online scheduling with rejection revisited
- Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- On-line scheduling with rejection on identical parallel machines
- Penalty cost constrained identical parallel machine scheduling problem
- Online scheduling of unit jobs on three machines with rejection: a tight result
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Preemptive scheduling on a small number of hierarchical machines
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single-machine scheduling under the job rejection constraint
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups
This page was built for publication: Preemptive multiprocessor scheduling with rejection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958131)
