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

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

Many sensor network applications feature correlated traffic bursts: after a period of idle time with almost no network traffic, many nodes have to transmit large amounts of data simultaneously. One example is volcano monitoring [17], where rare eruptions trigger many nodes simultaneously to transmit seismic data traces. For such applications, a MAC protocol should exhibit a low overhead both in...

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