Sarkar and Zangwill (1991) showed by numerical examples that reduction in setup times can, surprisingly, actually increase work in process in some cyclic production systems (that is, reduction in switchover times can increase waiting times in some polling models). We present, for polling models with exhaustive and gated service disciplines, some explicit formulas that provide additional insight...

In the framework of perfect loop nests with uniform dependencies, tiling has been studied extensively as a source-to-source program transformation. We build upon recent results by HH ogsted, Carter, and Ferrante 10], who aim at determining the cumulated idle time spent by all processors while executing the partitioned (tiled) computation domain. We propose new, much shorter proofs of all their ...

We study options on short-term leases for capital-intensive equipment performing specific functions and services, such as leases for semi-submersible drilling rigs, marine seismic services, corporate real estate leasing, retail space leasing, and apartment leasing. We quantify the effect of an important factor in pricing options on these services: idle time between consecutive lease contracts. ...

Background and Objectives: Operating room (OR) scheduling is key to optimal operating room productivity. The significant uncertainty associated with surgery duration renders scheduling of surgical operation a challenging task. This paper proposes a novel computational stochastic model to optimize scheduling of surgeries with uncertain durations. The model considers various surgical operation co...

We address the problem of ambulance dispatching, in which we must decide which ambulance to send to an incident in real time. In practice, it is commonly believed that the 'closest idle ambulance' rule is near-optimal and it is used throughout most literature. In this paper, we present alternatives to the classical closest idle ambulance rule. Most ambulance providers as well as researchers foc...

In this paper, we describe an animation synthesizer that allows generating two layers of subtle motions: small posture variations and personalised change of balance. Such a motion generator is needed in many cases when one attempts to create an animation sequence out of a set of existing clips, in order to avoid unnaturallooking transitions or frozen waiting-states between clips. The motion syn...

Abstract: The object of this research in the queueing theory is the FunctionalStrong-Law-ofLarge-Numbers (FSLLN) under the conditions of heavy traffic in Multiphase Queueing Systems (MQS). A FSLLN is known as fluid limit or fluid approximation. In this paper, the FSLLN is proved for values of important probabilistic characteristics of the MQS investigated as well as the summary queue length of ...

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and=or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the...

This paper proposes an efficient exact algorithm for the general single-machine scheduling problem where machine idle time is permitted. The algorithm is an extension of the authors’ previous algorithm for the problem without machine idle time, which is based on the SSDP (Successive Sublimation Dynamic Programming) method. We first extend our previous algorithm to the problem with machine idle ...