Abstract
We are concerned with the problem of safely storing a history of actions that happen rapidly in real time, such as in “buy” and “sell” orders in stock exchange trading. This leads to a single-family scheduling problem with batching on a single machine, with a setup time and job release times, under batch availability. We investigate the objective of minimizing the total flow time in an online setting. On the positive side, we propose a 2-competitive algorithm for the case of identical job processing times, and we prove a lower bound that comes close. With general processing times, our lower bound shows that online algorithms are inevitably bad in the worst case.
We gratefully acknowledge the support of the Swiss SBF under contract no. C05.0047 within COST-295 (DYNAMO) of the European Union.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, B., Deng, X., Zang, W.: On-line scheduling a batch processing system to minimize total weighted job completion time. Journal of Combinatorial Optimization 8, 85–95 (2004)
Deng, X., Poon, C.K., Zhang, Y.: Approximation algorithms in batch processing. Journal of Combinatorial Optimization 7, 247–257 (2003)
Divakaran, S., Saks, M.: Online scheduling with release times and set-ups. Technical Report 2001-50, DIMACS (2001)
Epstein, L., van Stee, R.: Lower bounds for on-line single-machine scheduling. Theoretical Computer Science 299(1-3), 439–450 (2003)
Gfeller, B., Peeters, L., Weber, B., Widmayer, P.: Single machine batch scheduling with release times. Technical Report 514, ETH Zurich (2006), available at http://www.inf.ethz.ch/research/disstechreps/techreports
Lee, C.Y., Uzsoy, R., Martin-Vega, L.A.: Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40(4), 764–775 (1992)
Poon, C.K., Yu, W.: A flexible on-line scheduling algorithm for batch machine with infinite capacity. Annals of Operations Research 133, 175–181 (2005a)
Poon, C.K., Yu, W.: On-line scheduling algorithms for a batch machine with finite capacity. Journal of Combinatorial Optimization 9, 167–186 (2005b)
Potts, C., Kovalyov, M.: Scheduling with batching: A review. European Journal of Operational Research 120, 228–249 (2000)
Zhang, G., Cai, X., Wong, C.K.: On-line algorithms for minimizing makespan on batch processing machines. Naval Research Logistics 48, 241–258 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gfeller, B., Peeters, L., Weber, B., Widmayer, P. (2006). Online Single Machine Batch Scheduling. In: Královič, R., Urzyczyn, P. (eds) Mathematical Foundations of Computer Science 2006. MFCS 2006. Lecture Notes in Computer Science, vol 4162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11821069_37
Download citation
DOI: https://doi.org/10.1007/11821069_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37791-7
Online ISBN: 978-3-540-37793-1
eBook Packages: Computer ScienceComputer Science (R0)