New approximation algorithms for machine scheduling with rejection on single and parallel machine
From MaRDI portal
Publication:830930
Recommendations
- Parallel-machine scheduling with release dates and rejection
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Single machine scheduling with release dates and rejection
- Scheduling on single machine and identical machines with rejection
- Scheduling with release times and rejection on two parallel machines
Cites work
- A survey on offline scheduling with rejection
- Algorithms and Data Structures
- An improved heuristic for parallel machine scheduling with rejection
- Faster algorithms for single machine scheduling with release dates and rejection
- Improved algorithms for single machine scheduling with release dates and rejections
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Multiprocessor Scheduling with Rejection
- On-line scheduling of unit time jobs with rejection: Minimizing the total 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
- Parallel-machine scheduling with release dates and rejection
- Preemptive multiprocessor scheduling with rejection
- Preemptive scheduling with rejection
- Revised delivery-time quotation in scheduling with tardiness penalties
- Scheduling linear deteriorating jobs with rejection on a single machine
- Scheduling with release times and rejection on two parallel machines
- Single machine scheduling with release dates and rejection
- Techniques for scheduling with rejection
- Theory and Applications of Models of Computation
Cited in
(47)- Single machine scheduling with release dates and rejection
- Preemptive scheduling with rejection
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Vector scheduling with rejection on a single machine
- On the parameterized tractability of single machine scheduling with rejection
- Multipurpose machine scheduling with rejection and identical job processing times
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Single machine scheduling with rejection and generalized parameters
- Single machine scheduling with rejection to minimize the weighted makespan
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- Minimizing the makespan on a single parallel batching machine
- Scheduling with release times and rejection on two parallel machines
- Improved algorithms for single machine scheduling with release dates and rejections
- An improved heuristic for parallel machine scheduling with rejection
- scientific article; zbMATH DE number 1670665 (Why is no real title available?)
- Faster algorithms for single machine scheduling with release dates and rejection
- Parallel-machine scheduling with release dates and rejection
- Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
- Scheduling parallel machines with inclusive processing set restrictions and job rejection
- Approximation algorithms for single machine parallel-batch scheduling with release dates subject to the number of rejected jobs not exceeding a given threshold
- Scheduling on single machine and identical machines with rejection
- Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost
- Machine scheduling with job rejection and Dejong's learning effect
- Parallel-batch scheduling with rejection: structural properties and approximation algorithms
- Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan
- Order acceptance and scheduling with delivery under generalized parameters
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
- Bag-of-tasks scheduling with rejection in large computing systems
- An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
- Minimizing the maximum lateness for scheduling with release times and job rejection
- W-prize-collecting scheduling problem on parallel machines
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- W-prize-collecting with release dates on a single machine
- An efficient heuristic for a real-life OAS problem
- Fifty years of research in scheduling -- theory and applications
- Scheduling on parallel-batch machines with rejection and resource matching
- Order acceptance and scheduling with weighted makespan
- Two-machine job shop scheduling with optional job rejection
- Formulations and heuristic for the long-term preventive maintenance order scheduling problem
- Logic-based Benders decomposition for order acceptance and scheduling on heterogeneous factories with carbon caps
- Multiple identical serial-batch machines scheduling with release dates and submodular rejection penalties
- Benders decompositions for order acceptance and scheduling in additive manufacturing
- Single-machine lot scheduling with order rejection
- Penalty cost constrained identical parallel machine scheduling problem
- Single-machine scheduling under the job rejection constraint
This page was built for publication: New approximation algorithms for machine scheduling with rejection on single and parallel machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q830930)
