نتایج جستجو برای: task assignment problem
تعداد نتایج: 1152456 فیلتر نتایج به سال:
The paper presents experimental results on quadratic assignment problem. The “scanning area” method formulated for radioelectronic equipment design is applied. For all more complex tests ours results are better or coincident with the ones known in literature. Conclusion concerning the effectiveness of method are given.
Motivated by the common academic problem of allocating papers to referees for conference reviewing we propose a novel mechanism for solving the assignment problem when we have a two sided matching problem with preferences from one side (the agents/reviewers) over the other side (the objects/papers) and both sides have capacity constraints. The assignment problem is a fundamental problem in both...
In this paper we consider the problem of system assignment for the class of linear output feedback systems having symmetric state space realisations. For such systems the classical pole placement task can be considered as a degenerate case of a more general system assignment problem. It is shown that a symmetric state space realisation can be assigned arbitrary (real) poles via output feedback ...
Task scheduling in heterogeneous parallel and distributed computing environment is a challenging problem. Applications identified by parallel tasks can be represented by directed-acyclic graphs (DAGs). Scheduling refers to the assignment of these parallel tasks on a set of bounded heterogeneous processors connected by high speed networks. Since task assignment is an NP-complete problem, instead...
Most large organizations, such as corporations, are hierarchical organizations. In hierarchical organizations each entity in the organization, except the root entity, is a sub-part of another entity. In this paper we study the task assignment problem to the entities of tree-like hierarchical organizations. The inherent tree structure introduces an interesting and challenging constraint to the s...
We prove that, for two simple functions drlt, solving the online assignment problem with crl − drlt as the contribution for assigning resource r to task l at time t gives the optimal solution to the corresponding offline assignment problem (provided the optimal offline solution is unique). We call such functions drlt optimal discount functions.
This paper studies delegation of authority in a setting that combines the incentive view of delegation pioneered by Aghion and Tirole [1997], the informational theory of delegation emphasized by Dessein [2002], the learning possibility put forth by Aghion, Dewatripont, and Rey [2004] and the career concerns literature spawned by Holmström [1999]. I show that the principal may choose delegation ...
Heterogeneous Distributed systems have been an active research area in computer science for the last two decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i. e. the completion time at the maximum loaded computing node). This paper presents and discusses ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید