Parallel-batch scheduling with rejection: structural properties and approximation algorithms
From MaRDI portal
Publication:6113447
DOI10.1016/j.ejor.2023.04.019MaRDI QIDQ6113447
Xueling Zhong, Jinwen Ou, Ling-Fa Lu
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
- Faster algorithms for single machine scheduling with release dates and rejection
- A survey on offline scheduling with rejection
- New approximation algorithms for machine scheduling with rejection on single and parallel machine
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Single-machine scheduling under the job rejection constraint
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
- Single machine scheduling with release dates and rejection
- Scheduling a batching machine
- Approximation algorithms in batch processing
- Scheduling one batch processor subject to job release dates
- Bicriteria order acceptance and scheduling with consideration of fill rate
- On scheduling an unbounded batch machine
- Minimizing makespan in batch machine scheduling
- Scheduling with batching: A review
- On the parameterized tractability of single machine scheduling with rejection
- A survey of scheduling with parallel batch (p-batch) processing
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Mixed batch scheduling on identical machines
- Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Coordinated scheduling of the outsourcing, in-house production and distribution operations
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling parallel machines with inclusive processing set restrictions and job rejection
- Scheduling Groups of Jobs on a Single Machine
This page was built for publication: Parallel-batch scheduling with rejection: structural properties and approximation algorithms