2015/02/08 by István Szalkai, Szalkai, Istvan, György Dósa +1
Computer Science · Engineering · #Advanced Manufacturing and Logistics Optimization #Distributed #Distributed and Parallel Computing Systems #FOS: Computer and information sciences #Parallel #Scheduling and Optimization Algorithms #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.1502.02304
openalex publication_date 2015/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider different online algorithms for a generalized scheduling problem for parallel machines, described in details in the first section. This problem is the generalization of the classical parallel machine scheduling problem, when the make-span 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.