We show how to evaluate the performance of solutions to finite-horizon scheduling problems where task durations are specified by bounded uniform distributions. Our computational technique, based on computing the volumes of zones, constitutes a contribution to the computational study of scheduling under uncertainty and stochastic systems in general.

In this paper we study optimal transient scheduling for an unflexible, two part-type, symmetric manufacturing system characterized by non negligible setup times and finite buffer capacities. The solution method relies on the exploitation of necessary conditions of optimality of the control policies to introduce a sampled version of the original system dynamics. By means of such a sampled model ...

Batch flow shops model systems that process a variety of job types using a fixed infrastructure. This model has applications in several areas including chemical manufacturing, building construction, and assembly lines. Since the throughput of such systems depends, often strongly, on the sequence in which they produce various products, scheduling these systems becomes a problem with very practic...

In a multi-user downlink system, the use of channel estimates in the scheduling process can significantly improve the spectral efficiency. Recent work has shown that from a sum rate capacity standpoint, and assuming infinite queue backlogs, the optimal transmission scheme is to select the user with the largest instantaneous channel gain. A more realistic scenario is considered in this work, in ...

In this paper, we show that a simple distributed algorithm for network scheduling in arbitrary m processor networks with unit capacity links is an O(logm)-approximation algorithm if the optimal schedule length is su ciently large. We will assume that there are m machines or processors labeled p1; p2; : : : ; pm, such that processor pi has ji jobs and P i ji = n. Let d be the maximum degree in t...

Simulation-based production scheduling approaches are emerging as alternatives to optimization and simpler approaches such as priority rules. This paper presents an application of a simulation-based finite scheduling at Albany International, the largest manufacturer of paper machine clothing in the world. Simulation is used as a decision support tool for manual schedule creation. User experienc...

Modern compilers employ sophisticated instruction scheduling techniques to shorten the number of cycles taken to execute the instruction stream. In addition to correctness, the instruction scheduler must also ensure that hardware resources are not oversubscribed in any cycle. For a contemporary processor implementation with multiple pipelines and complex resource usage restrictions , this is no...

We consider the scheduling of deferrable charging demand for plug-in electric or hybrid-electric vehicles (PEVs/PHEVs) in the smart grid such that the grid is operating within the safety charging threshold, and as many as consumers/users are satisfied by the end of a finite horizon (e.g., 8pm6am). Given that the charging profiles of PEVs/PHEVs are not constant and have a (truncated) prescribed ...

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...