Online Algorithms for a Generalized Parallel Machine Scheduling Problem

Open access


We consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the second section. This problem is the generalization of the classical parallel machine scheduling problem, when the makespan is minimized; in that case each job contains only one task. On the other hand, the problem in consideration is still a special version of the workflow scheduling problem. We present several heuristic algorithms and compare them by computer tests.

If the inline PDF is not rendering correctly, you can download the PDF file here.

  • [1] Dósa Gy.: "Online workflow scheduling: theoretical and practical results" Manuscript 2014. Januar.

  • [2] Dósa Gy.: "A heuristic algorithm for maintaning the scheduling resources using historic data: developing and testing" (in Hungarian) Project Report 2014. November.

  • [3] Graham R.L. "Bounds on multiprocessor timing anomalies" SIAM J. Appl. Math. 17 (1969) 416-429.

  • [4] SharpA. McDermott P.: "Workflow Modeling: Tools for Process Improvement and Applications Development" 2008 978596931930

  • [5] Szalkai I.: "Implementing and testing variants of online scheduling algorithms including ILP modeling I.-VI." (in Hungarian) Project Reports 2014.

  • [6] Szalkai I.: "Summary of running experiments LS-500k" Project Report 2014

  • [7] Szalkai I.: "Implementing and testing variants of online scheduling algorithms VII.: Parallel computations" (in Hungarian) Project Report 2015.

  • [8] Vízvári B.: "Introduction to the theory of process-direction" Lecture Notes ELTE 1993 (in Hungarian)

  • [9]

  • [10] Wil van der Aalst Kees Max van Hee: "Workflow Management: Models Methods and Systems" 2002 9780262011891

Journal information
All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 141 45 7
PDF Downloads 94 36 7