AN EXPERIMENTAL INVESTIGATION AND COMPARATIVE EVALUATION OF PRIORITY DISCIPLINES IN JOB SHOP-LIKE QUEUEING NETWORKS.
Doctoral thesis; Management Science Research Project,
CALIFORNIA UNIV LOS ANGELES
Pagination or Media Count:
A job shop model including several one-machine centers is considered. Jobs from outside the system arrive for service in a Poisson time series. Upon entering the system, each job is assigned a unique routing. The sequence of service centers on a jobs routing is generated by means of a transition probability matrix, fixed in time, which associates with each center the probabilities of going to any other center or out of the system. Processing times at each center are statistically independent and exponentially distributed. In general, queues form at the centers. A computer simulator was written in SIMSCRIPT. Attention was focused on flow time distributions of jobs, with alternative priority schemes. A total of ten different static priority rules was investigated.