Single machine batch scheduling with release times
From MaRDI portal
Publication:732326
DOI10.1007/S10878-007-9114-0zbMATH Open1176.90214OpenAlexW2005078873MaRDI QIDQ732326FDOQ732326
Authors: Beat Gfeller, Leon Peeters, Birgitta Weber, Peter Widmayer
Publication date: 9 October 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/6805
Recommendations
Cites Work
- Scheduling with batching: A review
- Approximation algorithms in batch processing
- On-line scheduling a batch processing system to minimize total weighted job completion time
- A flexible on-line scheduling algorithm for batch machine with infinite capacity
- On-line scheduling algorithms for a batch machine with finite capacity
- Lower bounds for on-line single-machine scheduling.
- On-line algorithms for minimizing makespan on batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Scheduling Groups of Jobs on a Single Machine
- The complexity of one-machine batching problems
- Batch sizing and job sequencing on a single machine
- Single machine batch scheduling with release times
- An online algorithm for a problem in scheduling with set-ups and release times
- Minimizing mean completion time in a batch processing system
- ON MINIMIZING TOTAL COMPLETION TIME IN BATCH MACHINE SCHEDULING
- Algorithm Theory - SWAT 2004
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)