Single machine batch scheduling with release times
- 75 Downloads
Motivated by a high-throughput logging system, we investigate the single machine scheduling problem with batching, where jobs have release times and processing times, and batches require a setup time. Our objective is to minimize the total flow time, in the online setting. For the online problem where all jobs have identical processing times, we propose a 2-competitive algorithm and we prove a corresponding lower bound. Moreover, we show that if jobs with arbitrary processing times can be processed in any order, any online algorithm has a linear competitive ratio in the worst case.
KeywordsBatch scheduling Online algorithms Competitive analysis
Unable to display preview. Download preview PDF.
- Bein W, Epstein L, Larmore L, Noga J (2004) Optimally competitive list batching. In: 9th Scandinavian workshop on algorithms theory (SWAT). Lecture notes in computer science, vol 3111. Springer, Berlin, pp 77–89 Google Scholar
- Cheng T, Kovalyov M (2001) Single machine batch scheduling with sequential job processing. IIE Trans Sched Logist 33:413–420 Google Scholar
- Divakaran S, Saks M (2001) Online scheduling with release times and set-ups. Technical Report 2001-50, DIMACS Google Scholar
- Gfeller B, Peeters L, Weber B, Widmayer P (2006) Single machine batch scheduling with release times. Technical Report 514, ETH Zurich, April 2006 Google Scholar