Volume 13, Issue 2 (8-2016)                   2016, 13(2): 35-52 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Optimization Parallel Algorithm Scheduling by Genetic Algorithm. Journal of Operational Research and Its Applications. 2016; 13 (2) :35-52
URL: http://jamlu.liau.ac.ir/article-1-1346-en.html
Abstract:   (3944 Views)

In scheduling, a set of machines in parallel is a setting that is important, from both the theoretical and practical points of view. From the theoretical viewpoint, it is a generalization of the single machine scheduling problem. From the practical point of view the occurrence of resources in parallel is common in real-world. When machines are computers, a parallel program can be conceived as a set of parallel components (tasks) which can be executed according to some precedence relationship. This paper shows the problem of allocating a number of non-identical tasks in a multi-processor or multicomputer system. The model assumes that the system consists of a number of identical processors and only one task may execute on a processor at a time. All schedules and tasks are non-preemptive.

Full-Text [PDF 311 kb]   (913 Downloads)    
Type of Study: Research | Subject: Special
Received: 2016/10/1 | Accepted: 2016/10/1 | Published: 2016/10/1

Add your comments about this article : Your username or Email:

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.