نتایج جستجو برای: Task assignment problem
تعداد نتایج: 1152456 فیلتر نتایج به سال:
task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
The problem of scheduling is an area that has attracted a lot attention from researchers for many years. Its goal to optimize resources in the system. lecturer’s assigning task example timetabling problem, class scheduling. This study introduces mathematical model assign constrained tasks (the time and required skills) university lecturers. Our capable generating calendar maximizes faculty expe...
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
this study investigates the problem of translating religious allusions in persian literature, namely the ones borrowed from quranic verses and hadiths. the purpose of this study is to shed light on how different translators dealt with such a task and also to provide guidelines for translators in coping with religious allusions.
We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution and communication costs. The problem is NP-hard. We present an exact algorithm based on the well-known A search. We report simulation results over a wide range of parameters ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید