Scheduling with release times and rejection on two parallel machines
From MaRDI portal
Publication:2359797
Recommendations
- Parallel-machine scheduling with release dates and rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Parallel machine scheduling with restricted job rejection
Cites work
- A survey on offline scheduling with rejection
- An improved heuristic for parallel machine scheduling with rejection
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Improved algorithms for single machine scheduling with release dates and rejections
- Multiprocessor Scheduling with Rejection
- Order acceptance and scheduling with machine availability constraints
- Parallel-machine scheduling with release dates and rejection
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single machine scheduling with release dates and rejection
- Techniques for scheduling with rejection
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
Cited in
(30)- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- Techniques for scheduling with rejection
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- Algorithms for single machine scheduling problem with release dates and submodular penalties
- Flowshop scheduling with learning effect and job rejection
- Minimizing maximum delivery completion time for order scheduling with rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- Two-machine open-shop scheduling with rejection to minimize the makespan
- Scheduling with rejection to minimize the total weighted completion time
- A full polynomial-time approximation scheme of two-agent scheduling with job rejection
- \(W\)-prize-collecting scheduling problem on parallel machines
- Minimizing the maximum lateness for scheduling with release times and job rejection
- Parallel-machine scheduling with release dates and rejection
- Minmax scheduling problems with common due-date and completion time penalty
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Single machine lot scheduling with optional job-rejection
- An improved heuristic for parallel machine scheduling with rejection
- Vector scheduling with rejection on two machines
- Two-agent parallel-machine scheduling with rejection
- scientific article; zbMATH DE number 1558091 (Why is no real title available?)
- Vector scheduling with rejection on a single machine
- Scheduling with rejection
- Scheduling with Rejection to Minimize the Makespan
- Scheduling with rejection subject to release times and precedence constraints
- Large-scale medical examination scheduling technology based on intelligent optimization
- Parallel-machine scheduling problem under the job rejection constraint (extended abstract)
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- Regular scheduling measures on proportionate flowshop with job rejection
This page was built for publication: Scheduling with release times and rejection on two parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359797)