In this paper a class of queueing model is studied where servers break down but the information regarding breakdowns is not immediately available. As such, jobs continue to arrive into a queue for some period after service has ceased. These queues have finite capacity, therefore there is also the possibility that queues become full causing jobloss. The effect of the duration of any delay on inf...

This paper discusses the use of the finite capacity planning model as a basis for a job-shop scheduling system. The suitability of this approach for constructing short term schedules with very short lead times is examined. This paper introduces a rule-based scheduling system whose operation, unlike previous monolithic schedulers, is based around distinct though interlinked processes. Scheduling...

The Finite-State Markov Channel (FSMC) is a discrete time-varying channel whose variation is determined by a finite-state Markov process. These channels have memory due to the Markov channel variation. We obtain the FSMC capacity as a function of the conditional channel state probability. We also show that for i.i.d. channel inputs, this conditional probability converges weakly, and the channel...

This research unites traditionally disparate developmental domains—cognition and locomotion—to examine the classic cognitive issue of the development of inhibition in infancy. In 2 locomotor A-not-B tasks, 13-month-old walking infants inhibited a prepotent response under low task demands (walking on flat ground), but perseverated under increased task demands (descending a staircase). Despite el...

MRP (Material Requirement Planning) process generates a production plan which guarantees an exact quantity of right materials on needed time but it sometimes causes capacity problems in the shop floor because of its ignorance on capacity constraints. This paper presents a new planning method which involves the capacity planning during the MRP process. This planning method starts from generating...

A finite capacity planning heuristic is developed for semiconductor manufacturing with highmix low-volume production, complex processes, variable cycle times and reentrant flows characteristics. The proposed algorithm projects production lots trajectories (start and end dates) for the remaining process steps, estimates the expected load for all machines and balances the workload against bottlen...

Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained for the same system but by means of different techniques, can often be numerically very different. The project is aimed at finding common denominators for numerical results obt...

We study the problem of multicasting over a network of multiple-access channels (MACs). The separation-based solution to this problem is to reduce each MAC to a set of noiseless bit pipes via a channel code and then employ network coding. Sometimes, however, the physical-layer structure of the MAC can be exploited more advantageously. In many cases of interest, the MAC output is a (deterministi...

In this article, we propose a new way to improve master production schedule (MPS) stability under conditions of finite capacity. The purpose is to optimize product availability and customer service for typical situations encountered in the consumer goods industry. Using a comprehensive MPS model, we conduct a simulation study with experimental design to identify factors having a significant inf...