The problem of scheduling n dependent tasks, with arbitrary processing times, on m identical machines so as to minimize the range criterion is considered. Since this problem is NP-complete in the strong sense, it can be solved only suboptimally using heuristic approaches. Four existing heuristic algorithms (dispatching rules), namely the CP/MISF, DHLF/MISF, MVT/MISF, and DMVT/MISF algorithms, are proposed for this problem. These algorithms are then used together as the dispatching rule base of a new combinatorial positional value dispatching (CPVD) rule. This combinatorial dispatching rule has a superior behaviour compared to simple dispatching rules. Extended experimentation with these algorithms supports this argument. In addition, some empirical rules are derived and proposed for the selection of a simple dispatching rule (heuristic), if such a selection is required, for each particular input data set.
Schedule Problem Schedule Algorithm Task Graph Combinatorial Rule Priority List
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscoMATHGoogle Scholar
Chen CL, Lee CSG, Hou ESH (1988) Efficient scheduling algorithms for robot inverse computation on a multiprocessor system. IEEE T Syst Man Cybern 18(5):729–742CrossRefGoogle Scholar
Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice Hall, Englewood Cliffs, NJMATHGoogle Scholar
Blum A, Furst M (1995) Fast planning through plan-graph analysis. In: 14th international joint conference on artificial intelligence. Morgan-Kaufmann Editions, pp 1636–1642Google Scholar
Tzafestas SG, Triantafyllakis A (1993) Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms. Math Comput Simulat 35(5):397–434CrossRefMathSciNetGoogle Scholar