Minimizing the makespan on a single parallel batching machine
From MaRDI portal
Publication:2268874
DOI10.1016/j.tcs.2009.12.008zbMath1186.68070MaRDI QIDQ2268874
Haodi Feng, Shenpeng Lu, Xiuqian Li
Publication date: 9 March 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.12.008
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Cites Work
- Unnamed Item
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Scheduling linear deteriorating jobs with rejection on a single machine
- Bounded single-machine parallel-batch scheduling with release dates and rejection
- Single machine scheduling with release dates and rejection
- Scheduling a batching machine
- Preemptive scheduling with rejection
- Scheduling with batching: A review
- Scheduling with rejection and non-identical job arrivals
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Bin packing problems with rejection penalties and their dual problems
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Scheduling Groups of Jobs on a Single Machine
- Multiprocessor Scheduling with Rejection
- Bin Packing with Rejection Revisited
- Theory and Applications of Models of Computation
- Preemptive multiprocessor scheduling with rejection
