نتایج جستجو برای: task assignment problem
تعداد نتایج: 1152456 فیلتر نتایج به سال:
Problem-solving methods for knowledge-based systems establish the behavior of such systems by de ning the roles in which domain knowledge is used and the ordering of inferences. Developers can compose problem-solving methods that accomplish complex application tasks from primitive, reusable methods. The key steps in this development approach are task analysis, method selection (from a library),...
In this research, a new model for cost-oriented assembly line balancing problem has been presented that consists of labour and equipment cost. The approach of this model for these costs is coincided with real condition of assembly lines and yield possibility of using common equipment amoung tasks. The objective function and constrains of this model has been shown by mathematical relations and ...
Recently, with the rapid development of mobile devices and the crowdsourcing platforms, the spatial crowdsourcing has attracted much attention from the database community. Specifically, spatial crowdsourcing refers to sending a location-based request to workers according to their positions, and workers need to physically move to specified locations to conduct tasks. Many works have studied task...
The identification of switched systems is a challenging problem, which entails both combinatorial (sample-mode assignment) and continuous (parameter estimation) features. A general framework for this problem has been recently developed, alternates between parameter estimation sample-mode assignment, solving tasks to global optimality under mild conditions. This article extends the nonlinear cas...
in this paper we present the problem of designing a three level hub center network. in our network, the top level consists of a complete network where a direct link is between all central hubs. the second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. we model this problem in an incomplete net...
In this paper we consider the classical multiprocessor scheduling problem. In this problem, the goal is to assign a collection of tasks with different execution times to a set of machines so that the total load is balanced as evenly as possible across the machines. This objective is typically expressed as minimization of the makespan, or the load on the most heavily loaded machine. In general, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید