Multipurpose machine scheduling with rejection and identical job processing times
From MaRDI portal
Recommendations
- Scheduling on single machine and identical machines with rejection
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
- Single-machine scheduling under the job rejection constraint
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
Cites work
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- A branch-and-bound algorithm for the singly constrained assignment problem
- A Lagrangean relaxation method for the constrained assignment problem
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- A survey on offline scheduling with rejection
- Algorithms and Data Structures
- An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique.
- An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
- An optimal rounding gives a better approximation for scheduling unrelated machines
- Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for scheduling and covering on unrelated machines
- Complexity of scheduling problems with multi-purpose machines
- Exact and Approximate Algorithms for Scheduling Nonidentical Processors
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Multicriteria scheduling problems: a survey
- New algorithms for an ancient scheduling problem.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling of machine-dependent jobs with unit-length.
- Parallel machine scheduling with job assignment restrictions
- Parallel machine scheduling with nested processing set restrictions
- Parallel-machine scheduling with deteriorating jobs and rejection
- Preemptive scheduling with rejection
- Reducibility among combinatorial problems
- Resource-Constrained Assignment Scheduling
- Scheduling jobs with equal processing times subject to machine eligibility constraints
- Scheduling parallel machines with inclusive processing set restrictions
- Scheduling parallel machines with inclusive processing set restrictions and job release times
- Scheduling unit length jobs with parallel nested machine processing set restrictions
- Scheduling unit-length jobs with machine eligibility restrictions
- Scheduling with Rejection to Minimize the Makespan
- Semi-matchings for bipartite graphs and load balancing
- Task Scheduling on a Multiprocessor System with Independent Memories
- Technical Note—Minimizing Average Flow Time with Parallel Machines
- Techniques for scheduling with rejection
- Theory and Applications of Models of Computation
Cited in
(7)- Flowshop scheduling with learning effect and job rejection
- Single-machine scheduling with maintenance activities and rejection
- Parallel machine scheduling with restricted job rejection
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- scientific article; zbMATH DE number 871904 (Why is no real title available?)
This page was built for publication: Multipurpose machine scheduling with rejection and identical job processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018939)
