The multi-arm bandit problem is widely used in scheduling of traffic in broadband networks, manufacturing systems and robotics. This paper presents a finite dimensional optimal solution to the multi-arm bandit problem for Hidden Markov Models. The key to solving any multi-arm bandit problem is to compute the Gittins index. In this paper a finite dimensional algorithm is presented which exactly ...

We study the problem of monitoring concurrent program runs for atomicity violations. Unearthing fundamental results behind scheduling algorithms in database control, we build space-efficient monitoring algorithms for checking atomicity that use space polynomial in the number of active threads and entities, and independent of the length of run monitored. Second, by interpreting the monitoring al...

Title of Thesis: Scheduling transmissions in wireless ad-hoc networks with time-varying topologies Anna Pantelidou, Master of Science, 2004 Thesis directed by: Professor Anthony Ephremides Department of Electrical and Computer Engineering In wireless ad-hoc networks, signal interference and collisions from simultaneous transmissions of neighboring nodes significantly degrade throughput. Hence, ...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

Multi-agent systems have been successfully applied to the scheduling problem for some time. However, their use often leads to poorly unsatisfactory disappointing results. A new multi-agent model, called supervisor, customers, environment, producers (SCEP), is suggested in this paper. This model, developed for all types of planning activities, introduces a dialogue between two communities of age...

The max-min fair scheduling problem in wireless ad-hoc networks is a non-convex optimization problem. A general framework is presented for this optimization problem and analyzed to obtain a dual problem, which involves solving a series of optimization sub-problems. In the limit of infinite bandwidth ( ), the scheduling solution reduces to simultaneous transmission (spread spectrum) on all links...

In wireless networks, due to the shared medium, we require sophisticated algorithms to schedule concurrent transmissions that meet the interference constraint where two nodes cannot transmit simultaneously in a guaranteed interference range of each other. For the general (K -hop) interference model,1 especially with K ≥ 2, the throughputoptimal centralized scheduler needs to solve a NP-Hard pro...

optimally in a “reasonable” amount of time. NonetheWe describe the synthesis of efficient schedulers for planned shutdowns of power plants for refueling and maintenance (outages), using an automated programming tool, KIDS. Currently, the utility industry has no automated tools to generate schedules that are both safe and resource-efficient. We focused on safety constraints since they are critic...

In this work we propose a simultaneous scheduling and control optimization formulation to address both optimal steady-state production and dynamic product transitions in multiproduct parallel continuous stirred tank reactors. The simultaneous scheduling and control problem for multiproduct parallel continuous reactors is cast as a Mixed-Integer Dynamic Optimization (MIDO) problem. The reactor d...