##
**The time spent in a dynamic job shop.**
*(English)*
Zbl 0539.60091

Summary: An open queueing network model of dynamic job shops is considered here. Approximations for the time spent by a job in the job shop are derived. The accuracy of these approximations are demonstrated by comparing these approximate results to simulation results for some symmetric job shops and flow shops. These approximations are simple enough to be implemented on a personal computer and can be applied to any real job shop with local scheduling disciplines.

### MSC:

60K20 | Applications of Markov renewal processes (reliability, queueing networks, etc.) |

60K25 | Queueing theory (aspects of probability theory) |

90B22 | Queues and service in operations research |

60J10 | Markov chains (discrete-time Markov processes on discrete state spaces) |

PDF
BibTeX
XML
Cite

\textit{J. G. Shanthikumar} and \textit{J. A. Buzacott}, Eur. J. Oper. Res. 17, 215--226 (1984; Zbl 0539.60091)

Full Text:
DOI

### References:

[1] | Baskett, F.; Chandy, K. M.; Muntz, R. R.; Palacious, F. G., Open, closed and mixed networks of queues with different classes of customers, J. ACM, 22, 248-260 (1975) · Zbl 0313.68055 |

[2] | Bhat, N. U., Elements of Applied Stochastic Processes (1972), Wiley: Wiley New York · Zbl 0236.60001 |

[3] | Conway, R. W., Some tactical problems in digital simulation, Management Sci., 10, 47-61 (1963) |

[4] | Conway, R. W.; Maxwell, W. L.; Miller, L. W., Theory of Scheduling (1967), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 1058.90500 |

[5] | Jackson, J. R., Simulation research on job shop production, Naval Res. Logist. Quart., 4, 287-295 (1957) |

[6] | Jackson, J. R., Job shop-like queueing Systems, Management Sci., 10, 131-142 (1963) |

[7] | Kapadia, A. S.; Hsi, B. P., Steady state waiting time in a multicenter job shop, Naval Res. Logist. Quart., 25, 149-154 (1978) · Zbl 0391.60088 |

[8] | Lavenberg, S. S.; Sauer, C., Sequential stopping rules for regenerative method of simulation, IBM J. Res. Development, 21, 545-658 (1977) · Zbl 0366.68075 |

[9] | Panwalkar, S. S.; Iskander, W., A surveying of scheduling rules, Operations Res., 25, 45-61 (1977) · Zbl 0369.90054 |

[10] | Shanthikumar, J. G., Approximate queueing models of dynamic job shops, (Ph.D. Dissertation (1979), Department of Industrial Engineering, University of Toronto) · Zbl 0551.90023 |

[11] | Shanthikumar, J. G., Analysis of the effects of service time variability in a dynamic job shop using a simulation model, (Proc. Summer computer Simulation Conference (1981)), 377-382 |

[12] | Shanthikumar, J. G., On reducing time spent in M/G/1 Systems, European J. Operational Res., 9, 286-294 (1982) · Zbl 0475.60083 |

[13] | Shanthikumar, J. G.; Buzacott, J. A., On the approximation to the single server queue, Internat. J. Production Res., 18, 761-773 (1980) |

[14] | Shanthikumar, J. G.; Buzacott, J. A., Open queueing network models of dynamic job shops, Internat. J. Production Res., 19, 255-266 (1981) |

[15] | Simon, B.; Foley, R., Some results on sojourn times in acyclic Jackson networks, Management Sci., 25, 1027-1034 (1979) · Zbl 0465.90034 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.