This paper is concerned with dynamic scheduling in a queueing system that has two
independent Poisson input streams, two servers, deterministic service times and linear …

This paper surveys applications of queueing theory for semiconductor manufacturing
systems (SMSs). Due to sophisticated tool specifications and process flows in …

The aim of stochastic programming is to find optimal decisions in problems which involve
uncertain data. This field is currently developing rapidly with contributions from many …

Power grids, flexible manufacturing, cellular communications: interconnectedness has
consequences. This remarkable book gives the tools and philosophy you need to build …

We consider a general single-server multiclass queueing system that incurs a delay cost Ck
(τk) for each class k job that resides τk units of time in the system. This paper derives a …

One of the most important methods in dealing with the optimization of large, complex
systems is that of hierarchical decomposition. The idea is to reduce the overall complex …

The problem of reducing the mean and variance of cycle time in semiconductor
manufacturing plants is addressed. Such plants feature a characteristic reentrant process …

This paper concerns a dynamic scheduling problem for a queueing system that has two
streams of arrivals to infinite capacity buffers and two (nonidentical) servers working in …

We consider a queueing system with r non‐identical servers working in parallel, exogenous
arrivals into m different job classes, and linear holding costs for each class. Each arrival …

Novel advanced policy gradient (APG) methods, such as trust region policy optimization and
proximal policy optimization (PPO), have become the dominant reinforcement learning …