Dynamic priority dispatching rules in job shops require the computation of all job priorities in a work center queue every time a machine in the work center becomes idle. This is extremely costly. Alternative priority update procedures are studied and comparative results in terms of performance...

In this paper we consider the problem of scheduling "n" independent fades on "m" parallel processors. Each job consists of a single operation with a specific processing time and due date. The processors are identical and the operation of the system is non-preemptive. The objective is to schedule...

A quantitative comparison between three types of capacity planning or shop loading techniques is presented. The results were obtained from simulation experiments.

This paper presents a procedure for determining the number of simulation observations required to achieve a preassigned confidence interval for means estimated by simulation. This procedure, which is simple to implement and efficient to use, is compared with two other methods for determining the...