Job Shop Scheduling with Regular Batch Arrivals
- 1 June 1969
- journal article
- other
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers
- Vol. 184 (1) , 301-310
- https://doi.org/10.1243/pime_proc_1969_184_026_02
Abstract
This paper describes a simulation exercise of a hypothetical machine shop consisting of five non-identical machines. Jobs arrive in batches, each job having its own routing and operation time specifications, the average times being normally distributed. Nine alternative loading rules are investigated and the SI rule (the selection of the job with the shortest imminent operation) is found to be the most effective in reducing the mean job throughput time and delay factor, when the batch size is comparatively small. For large batches, however, the results suggest that the SI rule is not the most effective. Ways to reduce the variance of job waiting times are also investigated.Keywords
This publication has 2 references indexed in Scilit:
- Network Dispatching by the Shortest-Operation DisciplineOperations Research, 1962
- Simulation of a Simplified Job ShopManagement Science, 1960