A GASP simulation study of job-shop scheduling
- 1 January 1972
- journal article
- Published by SAGE Publications in SIMULATION
- Vol. 18 (1) , 1-10
- https://doi.org/10.1177/003754977201800102
Abstract
The purpose of this paper is to report on a study which involves a simulation of a hypothetical job shop with several machines. The investigation employs GASP-II as a computer language. This simulation study is concerned with: (1) testing a new method of assign ing job due-dates and (2) comparing and evaluating the effect of different processing-time distributions on the performance of a number of scheduling rules.Keywords
This publication has 10 references indexed in Scilit:
- A MODIFIED SI RULE IN JOB SHOP SCHEDULINGInternational Journal of Production Research, 1968
- EXPERIMENTS WITH PRIORITY DISPATCHING RULES IN A PARALLEL PROCESSOR SHOPInternational Journal of Production Research, 1967
- JOB SHOPS SCHEDULING WITH DUE DATESInternational Journal of Production Research, 1967
- A DECOMPOSITION APPROACH FOR THE MACHINE SCHEDULING PROBLEMInternational Journal of Production Research, 1967
- Heuristics in Job Shop SchedulingManagement Science, 1966
- Three Heuristic Rules for Sequencing Jobs to a Single Production FacilityManagement Science, 1965
- A Heuristic Procedure for Parallel Sequencing with Choice of MachinesManagement Science, 1964
- 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