Abstract

Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to use heuristics to find a good schedule rather than evaluating all possible schedules. List scheduling is generally accepted as an attractive approach, since it combines low complexity with good results. List scheduling consists of two phases: a task prioritization phase where a certain priority is computed and assigned to each task, and a machine assignment phase where each task (in order of its priority) is assigned a machine that minimizes a suitable cost function. This paper presents a machine assignment mechanism that can be used with any list-scheduling algorithm. The mechanism is called Reverse Duplicator Mechanism and outperforms the current mechanisms.

Keywords

Cite this article

@article{cai-1335,
  author  = {Tarek Hagras and Jan Janeček},
  title   = {A Machine Assignment Mechanism for Compile-Time List-Scheduling Heuristics},
  journal = {Computing and Informatics},
  volume  = {24},
  number  = {4},
  pages   = {341--350},
  year    = {2005},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2005/4/a-machine-assignment-mechanism-for-compile-time-list-scheduling-heuristics/}
}
Download .bib