A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time horizon [0, T ] is considered. The main result is the asymptotic optimality of a control policy derived via an underlying differential game. The result is the...

data grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. the heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. most existing scheduling algorithms in grids only focus on one kind of grid jobs which can be data...

Synthesis of gain scheduled controllers often requires that a parameter-varying controller be generated from a finite set of linear time-invariant controllers. We propose interpolation methods for this task with the property that stability of the linearized closed-loop system is preserved for each fixed value of the scheduling parameter. In addition, slow-variation arguments are presented that ...

With the introduction of constraints based on finite automata a new line of research has opened where constraints are based on formal languages. Recently, constraints based on grammars higher up in the Chomsky hierarchy were introduced. We devise a timeand space-efficient incremental arc-consistency algorithm for context-free grammars. Particularly, we show how to filter a sequence of monotonic...

We introduce the track parallelization problem (TPP) that consists in parallelizing the execution of task sets. For modelling and solving TPPs in a finite-domain constraintprogramming framework, we propose the TPP constraint along with a suitable solver for use in non-preemptive scheduling. We demonstrate how to infer redundant TPPs in school timetabling and we report a large-scale empirical st...

We analyze the performance of E-limited scheduling in Bluetooth piconets under bursty traffic finite buffer case. We model joint probability distributions of uplink and downlink queues using the M [x]/G/1/K model with vacations and derive buffer blocking probabilities at slaves and at the master. We also derive access delays at slave uplink buffers. Analytical results are validated through simu...

The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the...

Smart scheduling can be used to reduce infrastructure-to-vehicle energy costs in delay tolerant vehicular networks (Hammad et al., 2010). In this thesis we show that by combining this with vehicle-to-vehicle (V2V) forwarding, energy efficiency can be increased beyond that possible in the single hop case. This is accomplished by having the roadside infrastructure forward packets through vehicles...

We consider two minimum loss scheduling problems. Let the arrival epochs and processing times of n consecutive jobs be known. The first problem deals with the case these jobs can be processed by m parallel nonidentical machines without waiting room, i.e., a pure loss system. In the second problem there is one machine with a finite waiting room, i.e., a single machine delay-loss system. For both...

A wide spectrum of “real world” problems, such as vehicle routing, machine and crew scheduling, facility location, portfolio analysis, electricity generation planning, and communication and transportation network design, demands the use of combinatorial optimization methods. By a combinatorial optimization problem, we mean a program where a linear or nonlinear objective function must be optimiz...