Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Albers S, Brucker P (1993) The complexity of one-machine batching problems. Discrete Appl Math 47:87–107
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
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
Cheng T, Kovalyov M (2001) Single machine batch scheduling with sequential job processing. IIE Trans Sched Logist 33:413–420
Coffman E, Yannakakis M, Magazine M, Santos C (1990) Batch sizing and job sequencing on a single machine. Ann Oper Res 26:135–147
Deng X, Poon C, Zhang Y (2003) Approximation algorithms in batch processing. J Comb Optim 7:247–257
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
Divakaran S, Saks M (2001) Online scheduling with release times and set-ups. Technical Report 2001-50, DIMACS
Epstein L, van Stee R (2003) Lower bounds for on-line single-machine scheduling. Theor Comput Sci 299(1–3):439–450
Gfeller B, Peeters L, Weber B, Widmayer P (2006) Single machine batch scheduling with release times. Technical Report 514, ETH Zurich, April 2006
Lee C, Uzsoy R, Martin-Vega L (1992) Efficient algorithms for scheduling semiconductor burn-in operations. Oper Res 40(4):764–775
Poon C, Yu W (2004) On minimizing total completion time in batch machine scheduling. Int J Found Comput Sci 15(4):593–607
Poon C, Yu W (2005a) A flexible on-line scheduling algorithm for batch machine with infinite capacity. Ann Oper Res 133:175–181
Poon C, Yu W (2005b) On-line scheduling algorithms for a batch machine with finite capacity. J Comb Optim 9:167–186
Potts C, Kovalyov M (2000) Scheduling with batching: a review. Eur J Oper Res 120:228–249
Webster S, Baker K (1995) Scheduling groups of jobs on a single machine. Oper Res 43(4):692–703
Zhang G, Cai X, Wong C (2001) On-line algorithms for minimizing makespan on batch processing machines. Nav Res Logist 48:241–258
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of a part of this paper was presented at the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006). We gratefully acknowledge reviewers’ comments that helped to improve the presentation of this work.
Supported by the Swiss SBF under contract no. C05.0047 within COST-295 (DYNAMO) of the European Union.
Research carried out while B. Weber was affiliated with the Institute of Theoretical Computer Science, ETH Zurich.
Rights and permissions
About this article
Cite this article
Gfeller, B., Peeters, L., Weber, B. et al. Single machine batch scheduling with release times. J Comb Optim 17, 323–338 (2009). https://doi.org/10.1007/s10878-007-9114-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9114-0