Scheduling on Networks of Workstations with Task Runtime Restrictions


In recent time we spot a tendency to use the computing capacity of workstation clusters instead of investing in single machines with tremendous calculation power. Applying this idea we are able to execute multiple jobs paralelly. However, it still remains unclear how to schedule given jobs among available machines most effectively. Therefore this paper is an approach to optimization of mentioned scheduling. The problem faced here is known in the literature as parallel machine earliness-tardiness scheduling (PMSP_E/T). The optimum criterion is finding the minimal sum of the weighted earliness and tardiness penalties. Due to NP-hardness of specified problem and thus difficulty in locating the optimum we propose two heuristic algorithms to find a satisfying solution: genetic with MCUOX crossover operator and tabu search. We have conducted a research to compare the effectiveness of both approaches and display their dependence on the size of examined instances. Results proove genetic approach superiority over tabu search for larger instances.

DOI: 10.1109/ICN.2008.82

4 Figures and Tables

Cite this paper

@article{Bazyluk2008SchedulingON, title={Scheduling on Networks of Workstations with Task Runtime Restrictions}, author={Marcin Bazyluk and Leszek Koszalka and Keith J. Burnham}, journal={Seventh International Conference on Networking (icn 2008)}, year={2008}, pages={608-613} }