Abstract
We consider the online scheduling problem of parallel jobs on parallel machines, P|online − list,m j |C max. For this problem we present a 6.6623-competitive algorithm. This improves the best known 7- competitive algorithm for this problem. The presented algorithm also applies to the special case where machines are ordered on a line and only adjacent machines can be assigned to a job and, therefore, also to online orthogonal strip packing. Since previous results for online orthogonal strip packing assume bounded rectangles, the presented algorithm is the first with a constant competitive ratio.
Part of this research has been funded by the Dutch BSIK/BRICKS project.
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
Baker, B.S., Schwarz, J.S.: Shelf Algorithms for Two-Dimensional Packing Problems. SIAM Journal on Computing 12(3), 508–525 (1983)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Han, X., Ye, D., Zhang, G.: A note on online strip packing. Manuscript (2007)
Hurink, J.L., Paulus, J.J.: Online Scheduling of Parallel Jobs on Two Machines is 2-Competitive. Operations Research Letters (to appear) doi:10.1016/j.orl.2007.06.001
Johannes, B.: Scheduling parallel jobs to minimize the makespan. Journal of Scheduling 9, 433–452 (2006)
Pruhs, K., Sgall, J., Torng, E.: Online Scheduling. In: Leung, J.Y-T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 15, pp. 15–41. CRC Press, Boca Raton (2004)
Ye, D., Zhang, G.: On-line Scheduling of Parallel Jobs. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 279–290. Springer, Heidelberg (2004)
Ye, D., Zhang, G.: On-line Scheduling of Parallel Jobs in a List. Journal of Scheduling (to appear) doi:10.1007/s10951-007-0032-x
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hurink, J.L., Paulus, J.J. (2008). Online Algorithm for Parallel Job Scheduling and Strip Packing. In: Kaklamanis, C., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2007. Lecture Notes in Computer Science, vol 4927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77918-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-77918-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77917-9
Online ISBN: 978-3-540-77918-6
eBook Packages: Computer ScienceComputer Science (R0)