Studies in a Simulated Job Shop
- 1 June 1975
- journal article
- other
- Published by SAGE Publications in Proceedings of the Institution of Mechanical Engineers
- Vol. 189 (1) , 417-426
- https://doi.org/10.1243/pime_proc_1975_189_052_02
Abstract
The effectiveness of various scheduling or loading rules in a job shop has been widely studied through simulation, where a given shop can be subjected to alternative patterns of arrivals and processing. This study is particularly concerned with the case when arrivals are in batches, either of regular size or where the batch size is Poisson distributed, and when the batches arrive at regular time intervals, and certain empirical relationships between three loading rules are investigated. Two types of operational flexibility are examined, the first where more than one machine may perform a given operation and the second where changes in the sequence of operations are allowed, and the effect of such flexibilities on the expected job waiting time is determined. Finally, the effect of different procedures for determining due-dates for arriving jobs is investigated.Keywords
This publication has 10 references indexed in Scilit:
- Due dates in job shop schedulingInternational Journal of Production Research, 1976
- In favour of a modified SI rule in job-shop schedulingOmega, 1974
- A note on steady-state results in queueing and job-shop schedulingSIMULATION, 1974
- Research note The job shop simulation programmeInternational Journal of Production Research, 1973
- Job Shop Scheduling with Regular Batch ArrivalsProceedings of the Institution of Mechanical Engineers, 1969
- A MODIFIED SI RULE IN JOB SHOP SCHEDULINGInternational Journal of Production Research, 1968
- JOB SHOPS SCHEDULING WITH DUE DATESInternational Journal of Production Research, 1967
- Network Dispatching by the Shortest-Operation DisciplineOperations Research, 1962
- Simulation of a Simplified Job ShopManagement Science, 1960
- Simulation research on job shop productionNaval Research Logistics Quarterly, 1957