Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
From MaRDI portal
Publication:2215189
DOI10.1007/s10951-020-00657-4zbMath1456.90077OpenAlexW3035140752MaRDI QIDQ2215189
Publication date: 11 December 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00657-4
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Improved algorithms for single machine scheduling with release dates and rejections
- 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
- 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
- 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
- Scheduling one batch processor subject to job release dates
- Bicriteria order acceptance and scheduling with consideration of fill rate
- A constraint generation approach for two-machine shop problems with jobs selection
- On scheduling an unbounded batch machine
- Scheduling with batching: A review
- A survey of scheduling problems with setup times or costs
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling Groups of Jobs on a Single Machine
