This study explores the due-date performance of job shop control systems which base job due dates on a time-phased representation of the workload and the machine capacity in the shop. The performance is measured by the mean and the standard deviation of the lateness. Two parameters are used to...

Previous authors have shown that dynamic ratio scheduling rules do not always behave as intended. A recent proposal by Adam and Surkis (Adam, N. R., J. Surkis. 1980. Priority update intervals and anomalies in dynamic ratio type job shop scheduling rules. Management Sci. 26 (12, December)...

This paper summarizes an actual study conducted for the State Planning Organization of Turkey with the objective of formulating a national R&D policy, the implementation of which will contribute to the realization of the national goals stated in the development plans of the country. The study...

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

This paper describes a simulation study of assigning attainable or predictable due-dates in hypothetical labor and machine constrained job shop settings of varying size and structure. Several predictable due-date assignment rules are developed based on conditional estimates of individual job...

Increasingly simulations have been required as supportive evidence to management of proposed system changes. It has long been recognized that the computer running costs of simulations are strongly influenced by the synchronization mechanism used. Recently the time indexed list has been proposed...