Results 261 to 270 of about 5,532 (307)

The Asymptotic Optimality of the LPT Rule

open access: yesMathematics of Operations Research, 1987
For the problem of minimizing makespan on parallel machines of different speed, the behaviour of list scheduling rules is subjected to a probabilistic analysis under the assumption that the processing requirements of the jobs are independent, identically distributed nonnegative random variables.
A H G Rinnooy Kan
exaly   +4 more sources

Asymptotic Optimality of Balanced Routing

Operations Research, 2012
Consider a system with K parallel servers, each with its own waiting room. Upon arrival, a job is routed to the queue of one of the servers. Finding a routing policy that minimizes the total workload in the system is a known difficult problem in general.
Heng-Qing Ye
exaly   +2 more sources

Asymptotic Scaling of Optimal Cost and Asymptotic Optimality of Base-Stock Policy in Several Multidimensional Inventory Systems

open access: yesOperations Research
Title on author's file: Asymptotic scaling of optimal cost and asymptotic optimality of base-stock policy in several multi-dimensional inventory systems202408 bcchAccepted ManuscriptRGCPublishedGreen ...
Xiuli Chao, Xiting Gong, Jinzhi Bu
exaly   +2 more sources

Asymptotic Optimality of Running Consensus in Testing Binary Hypotheses

open access: yesIEEE Transactions on Signal Processing, 2010
Consensus in sensor networks is a procedure to corroborate the local measurements of the sensors with those of the surrounding nodes, and leads to a final agreement about a common value that, in detection applications, represents the decision statistic ...
Paolo Braca   +2 more
exaly   +2 more sources

On existence, optimality and asymptotic stability of the Kalman filter with partially observed inputs [PDF]

open access: yesAutomatica, 2015
For linear stochastic time-varying systems, we investigate the properties of the Kalman filter with partially observed inputs. We first establish the existence condition of a general linear filter when the unknown inputs are partially observed.
Jinya Su, Baibing Li, Wen-Hua Chen
exaly   +2 more sources

ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS

International Journal of Foundations of Computer Science, 2011
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph.
Carrier, Fabienne   +3 more
openaire   +3 more sources

Asymptotically Optimal Appointment Schedules

Mathematics of Operations Research, 2019
We consider the problem of scheduling appointments for a finite customer population to a service facility with customer no-shows to minimize the sum of customer waiting time and server overtime costs. Because appointments need to be scheduled ahead of time, we refer to this problem as an optimization problem rather than a dynamic control one. We study
Mor Armony, Rami Atar, Harsha Honnappa
openaire   +2 more sources

Home - About - Disclaimer - Privacy