We present a polyhedral framework for establishing general structural properties on optimal solutions of stochastic scheduling problems, where multiple job classes vie for service resources: the existence of an optimal priority policy in a given family, characterized by a greedoid (whose...

We present an intuitive stability condition for open multiclass queueing networks with Bernoulli routing: if each station has enough service capacity to cope with its peak traffic intensity, then the network is stable under any stationary nonidling scheduling policy. The condition is close to...

We address the problem of scheduling a multi-station multiclass queueing network (MQNET) with server changeover times to minimize steady-state mean job holding costs. We present new lower bounds on the best achievable cost that emerge as the values of mathematical programming problems (linear,...

We address the problem of scheduling a multiclass "M/M/m" queue with Bernoulli feedback on "m" parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers...

We study a model for scheduling 'n' classes of stochastic jobs on a single machine, with the objective of minimizing the total expected holding cost (discounted or undiscounted). We allow general holding cost rates that are separable, nondecreasing and convex on the number of jobs in each class....

We present a new unifying framework for investigating throughput-WIP (Work-in-Process) optimal control problems in queueing systems, based on reformulating them as linear programming (LP) problems with special structure: We show that if a throughput-WIP performance pair in a stochastic system...