نتایج جستجو برای: finite scheduling
تعداد نتایج: 325343 فیلتر نتایج به سال:
Consider the Hidden Markov model estimation problem where the realization of a single Markov chain is observed by a number of noisy sensors. The sensor scheduling problem for the resulting Hidden Markov model is as follows: Design an optimal algorithm for selecting at each time instant, one of the many sensors to provide the next measurement. Each measurement has an associated measurement cost....
This paper addresses optimal sensor scheduling for maximizing network lifetime. We formulate this problem as a nonstandard multi-armed bandit process with non-discounted reward and finite stopping time. We find that the optimal strategy should choose the sensor that has the largest Gittins’ index. Exploiting the underlying structure of sensor scheduling problem, we reduce the computational comp...
Grid workflow can be defined as an organization of Grid Services into a well-defined flow of operations, and can be thought of as the composition of Grid Services over time on heterogeneous and distributed resources in a well-defined order to accomplish a specific goal. To the time-constrained workflow Scheduling in Grids, we present a scheduling algorithm in terms of the finite-state continuou...
preventive maintenance scheduling of generating units is addressed as a long-term scheduling in power system studies aiming to increase the reliability incorporating cost reduction. it consists of knowing which generating units should be shut down for regular safety inspection. in this paper, a new formulation of preventive maintenance scheduling associated with cost reduction index (cri) is pr...
This paper addresses the lot sizing and scheduling problem for a number of products in flexible flow shop with identical parallel machines. The production stages are in series, while separated by finite intermediate buffers. The objective is to minimize the sum of setup and inventory holding costs per unit of time. The available mathematical model of this problem in the literature suffers from ...
The Shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. Certainly, the Shapley value can be used in interesting sharing cost/reward problems in the Operations Research area such as connection, routing, scheduling, production and inventory situations. In this paper, we focus on the Shapl...
Seokjoo Shin et al. 391 In this paper, we propose a packet scheduling discipline called packet loss fair scheduling, in which the packet loss of each user from different real-time traffic is fairly distributed according to the quality of service requirements. We consider an orthogonal frequency division multiple access (OFDMA) system. The basic frame structure of the system is for the downlink ...
A leitstand system is a scheduling and control station that plays the following role in computer integrated manufacturing. It receives information about production orders and resources from a MRP system (carrying out long and middle term production planning) and performs interactive or automatic finite capacity scheduling for the considered production resources (like machines, operators, tools,...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید