سال انتشار: ۱۳۹۰

محل انتشار: دومین کنفرانس ملی محاسبات نرم و فن آوری اطلاعات

تعداد صفحات: ۱۱

نویسنده(ها):

Samira Akhbarifar – Department of Mathematics and Computer Science AmirKabir University
M. E. Shiri – Department of Mathematics and Computer Science, AmirKabir University

چکیده:

Through this paper a solution based on the bee colony has been presented and evaluated for solving task scheduling problem. Precedence is taken in consideration fortasks and communication cost. A memory has been dedicated to each bee in order to speed up achieving the answer. Tasksscheduling in multi-processor systems are evaluated with some yardsticks such as time termination optimization, average waiting time and number of required processors. Thepresented solution is pursued so as to optimize all of the mentioned yardsticks. In this paper a DAG has been utilized to show the task relation including communication cost and precedence right as well. Task scheduling has a plentitude of applications in communication, manufacturing projects and project management.