Journal of Combinatorial Optimization

, Volume 17, Issue 3, pp 323–338 | Cite as

Single machine batch scheduling with release times

  • Beat Gfeller
  • Leon Peeters
  • Birgitta Weber
  • Peter Widmayer


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.


Batch scheduling Online algorithms Competitive analysis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Albers S, Brucker P (1993) The complexity of one-machine batching problems. Discrete Appl Math 47:87–107 MATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. Chen B, Deng X, Zang W (2004) On-line scheduling a batch processing system to minimize total weighted job completion time. J Comb Optim 8:85–95 MATHCrossRefMathSciNetGoogle Scholar
  4. Cheng T, Kovalyov M (2001) Single machine batch scheduling with sequential job processing. IIE Trans Sched Logist 33:413–420 Google Scholar
  5. Coffman E, Yannakakis M, Magazine M, Santos C (1990) Batch sizing and job sequencing on a single machine. Ann Oper Res 26:135–147 MATHCrossRefMathSciNetGoogle Scholar
  6. Deng X, Poon C, Zhang Y (2003) Approximation algorithms in batch processing. J Comb Optim 7:247–257 MATHCrossRefMathSciNetGoogle Scholar
  7. Deng X, Feng H, Zhang P, Zhang Y, Zhu H (2004) Minimizing mean completion time in a batch processing system. Algorithmica 38(4):513–528 MATHCrossRefMathSciNetGoogle Scholar
  8. Divakaran S, Saks M (2001) Online scheduling with release times and set-ups. Technical Report 2001-50, DIMACS Google Scholar
  9. Epstein L, van Stee R (2003) Lower bounds for on-line single-machine scheduling. Theor Comput Sci 299(1–3):439–450 MATHCrossRefGoogle Scholar
  10. 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
  11. Lee C, Uzsoy R, Martin-Vega L (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40(4):764–775 MATHCrossRefMathSciNetGoogle Scholar
  12. Poon C, Yu W (2004) On minimizing total completion time in batch machine scheduling. Int J Found Comput Sci 15(4):593–607 MATHCrossRefMathSciNetGoogle Scholar
  13. Poon C, Yu W (2005a) A flexible on-line scheduling algorithm for batch machine with infinite capacity. Ann Oper Res 133:175–181 MATHCrossRefMathSciNetGoogle Scholar
  14. Poon C, Yu W (2005b) On-line scheduling algorithms for a batch machine with finite capacity. J Comb Optim 9:167–186 MATHCrossRefMathSciNetGoogle Scholar
  15. Potts C, Kovalyov M (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249 MATHCrossRefMathSciNetGoogle Scholar
  16. Webster S, Baker K (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692–703 MATHCrossRefMathSciNetGoogle Scholar
  17. Zhang G, Cai X, Wong C (2001) On-line algorithms for minimizing makespan on batch processing machines. Nav Res Logist 48:241–258 MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Beat Gfeller
    • 1
  • Leon Peeters
    • 1
  • Birgitta Weber
    • 1
  • Peter Widmayer
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZurichZurichSwitzerland

Personalised recommendations