We propose an approximate method based on the mean value analysis for estimating the average performance of re-entrant ̄ ow shop with single-job machines and batch machines. The main focus is on the steady-state averages of the cycle time and the throughput of the system. Characteristics of the re-entrant ̄ ow and inclusion of the batch machines complicate the exact analysis of the system. Thus...

The basic definition of the re-entrant line, which constitutes the typical abstraction for the formal modelling and analysis of the fab scheduling problem, considers only the job contest for the finite processing capacity of the system workstations, ignoring completely the effects and complications arising from additional operational issues like the finite buffering capacity of the system works...

A microcomputer algorithm for tachycardia identification, suitable for use in an implanted antitachycardia pacemaker, is described. The system employs an atrial and ventricular electrogram, detects a sustained fast rate in either chamber, and awakens the main program to perform detailed analysis of the tachycardia and its immediately preceding beats. The algorithm distinguishes atrial, ventricu...

Firms in information technology (IT) intensive industries rely on IT investments to improve the quality of their products and services. Competing firms in these industries need to consider two opposing effects when they make IT investment decisions. The declining cost and improving performance of IT over time provides the later entrant a potential cost advantage. On the other hand, the first en...

Recently, manufacturing companies have been making efforts to increase resource utilization while ensuring the flexibility of production lines respond rapidly changing market environments and customer demand. In high-tech industry, which requires expensive facilities is capital-intensive, re-entrant are used for efficient with limited resources. such a system, part visits specific station repea...

We generalize the standard multi-class queueing network model by allowing both standard queues and infinite virtual queues which have infinite supply of work. We pose the general problem of finding policies which allow some of the nodes of the network to work with full utilization, and yet keep all the standard queues in the system stable. Towards this end we show that re-entrant lines, systems...

We compare two approaches for a Markovian model in flexible manufacturing systems (FMSs) using Monte Carlo simulation. The model which is a development of Fazlollahtabar and Saidi-Mehrabad (2013), considers two features of automated flexible manufacturing systems equipped with automated guided vehicle (AGV) namely, the reliability of machines and the reliability of AGVs in a multiple AGV jobsho...