A Computation Study in Mesh Networks by Scheduling Problems

  • G.E. Rizos
  • D.C. Vasiliadis
  • E. Stergiou
  • E. Glavas
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 27)


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.


  1. 1.
    Blazewicz J (1987) Selected topic on scheduling theory. Ann Discr Math 31:1–60MathSciNetGoogle Scholar
  2. 2.
    Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscoMATHGoogle Scholar
  3. 3.
    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
  4. 4.
    Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice Hall, Englewood Cliffs, NJMATHGoogle Scholar
  5. 5.
    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
  6. 6.
    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
  7. 7.
    Brucker P (1998) Scheduling algorithms. Springer, BerlinMATHGoogle Scholar
  8. 8.
    Luh JYS, Lin CS (1982) Scheduling of parallel computation for a computer controlled mechanical manipulator. IEEE T Syst Man Cybern 12(2):214–234CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • G.E. Rizos
    • 1
  • D.C. Vasiliadis
    • 1
  • E. Stergiou
    • 2
  • E. Glavas
    • 3
  1. 1.Department of Computer Science and TechnologyUniversity of PeloponneseTripolisGreece
  2. 2.Department of Informatics and Telecommunications TechnologyA.T.E.I. of EpirusArtaGreece
  3. 3.Department of Teleinformatics and ManagementA.T.E.I. of EpirusArtaGreece

Personalised recommendations