Single machine batch scheduling with release times
From MaRDI portal
Recommendations
Cites work
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- Algorithm Theory - SWAT 2004
- An online algorithm for a problem in scheduling with set-ups and release times
- Approximation algorithms in batch processing
- Batch sizing and job sequencing on a single machine
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Lower bounds for on-line single-machine scheduling.
- Minimizing mean completion time in a batch processing system
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- On-line algorithms for minimizing makespan on batch processing machines
- On-line scheduling a batch processing system to minimize total weighted job completion time
- On-line scheduling algorithms for a batch machine with finite capacity
- Scheduling Groups of Jobs on a Single Machine
- Scheduling with batching: A review
- Single machine batch scheduling with release times
- The complexity of one-machine batching problems
Cited in
(5)
This page was built for publication: Single machine batch scheduling with release times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732326)