Scheduling with release times and rejection on two parallel machines
From MaRDI portal
Publication:2359797
DOI10.1007/S10878-016-0016-XzbMATH Open1372.90056OpenAlexW2404044778MaRDI QIDQ2359797FDOQ2359797
Xueling Zhong, Zhangming Pan, Dakui Jiang
Publication date: 22 June 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0016-x
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
- Techniques for scheduling with rejection
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Single machine scheduling with release dates and rejection
- Improved algorithms for single machine scheduling with release dates and rejections
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A survey on offline scheduling with rejection
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Parallel-machine scheduling with release dates and rejection
- Multiprocessor Scheduling with Rejection
- Scheduling linear deteriorating jobs with rejection on a single machine
- Order acceptance and scheduling with machine availability constraints
- An improved heuristic for parallel machine scheduling with rejection
Cited In (18)
- Minimizing maximum delivery completion time for order scheduling with rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- Large-scale medical examination scheduling technology based on intelligent optimization
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
- Vector scheduling with rejection on a single machine
- Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times
- Single machine lot scheduling with optional job-rejection
- Flowshop scheduling with learning effect and job rejection
- Regular scheduling measures on proportionate flowshop with job rejection
- Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- Minmax scheduling problems with common due-date and completion time penalty
- Title not available (Why is that?)
- Algorithms for single machine scheduling problem with release dates and submodular penalties
- Scheduling with Rejection to Minimize the Makespan
- Techniques for scheduling with rejection
- Improved approximation algorithms for parallel machine scheduling with release dates and 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)