Online Algorithms for a Generalized Parallel Machine Scheduling Problem
arXiv:1502.02304
Abstract
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.
International Conference on Recent Achievements in Mechatronics, Automation, Computer Sciences and Robotics at SAPIENTIA University, Tirgu Mures, Romania on 6-7th March, 2015. http://www.macro.ms.sapientia.ro/