Classification of queueing models for a workstation with interruptions: a review

References

• Adan, I., and J. Resing. 2001. Queueing Theory. Eindhoven: Eindhoven University of Technology . http://www.win.tue.nl/~iadan/queueing.pdf.
   Google Scholar
• Allahverdi, A., C. T. Ng, T. C. E. Cheng, and M. Y. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187(3): 985–1032.
   Web of Science ®Google Scholar
• Avi-Itzhak, B., and P. Naor. 1963. “Some Queueing Problems with the Service Station Subject to Breakdown.” Operations Research 11: 303–320.
   Web of Science ®Google Scholar
• Baker, J., and I. Rubin. 1987. “Polling with a General-service Order Table.” IEEE Transactions on Communications 35(3): 283–288.
   Web of Science ®Google Scholar
• Boxma, O., M. Mandjes, and O. Kella. 2008. “On a Queuing Model with Service Interruptions.” Probability in the Engineering and Informational Sciences 22(4): 537–555.
   Web of Science ®Google Scholar
• Buzacott, J. A., and L. E. Hanifin. 1978. “Models of Automatic Transfer Lines with Inventory Banks – A Review and Comparison.” AIIE Transactions 10(2): 197–207.
   Web of Science ®Google Scholar
• Cheng, T. C. E., J. N. D. Gupta, and G. Wang. 2000. “A Review of Flowshop Scheduling Research with Setup Times.” Production and Operations Management 9(3): 262–282.
   Web of Science ®Google Scholar
• Doshi, B. 1986. “Queueing Systems with Vacations – A Survey.” Queueing Systems 1(1): 29–66.
   Google Scholar
• Eisenberg, M. 1972. “Queues with Periodic Service and Changeover Time.” Operations Research 20(2): 440–451.
   Web of Science ®Google Scholar
• Federgruen, A., and L. Green. 1986. “Queueing Systems with Service Interruptions.” Operations Research 34(5): 752–768.
   Web of Science ®Google Scholar
• Fuhrmann, S., and R. Cooper. 1985. “Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations.” Operations Research 33(5): 1117–1129.
   Web of Science ®Google Scholar
• Gaver, D. P. 1962. “A Waiting Line with Interrupted Service, including Priorities.” Journal of the Royal Statistical Society 24: 73–90.
   Google Scholar
• Golmakani, H. R. 2011. “Condition-based Inspection Scheme for Condition-based Maintenance.” International Journal of Production Research 50(14): 3920–3935.
   Web of Science ®Google Scholar
• Haque, L., and M. Armstrong. 2007. “A Survey of the Machine Interference Problem.” European Journal of Operational Research 179(2): 469–482.
   Web of Science ®Google Scholar
• Heyman, D. P. 1975. “A Diffusion Model Approximation for the GI/G/1 Queue in Heavy Traffic.” Bell System Technical Journal 54(9): 1637–1646.
   Google Scholar
• Hopp, W. J., and M. L. Spearman. 2008. Factory Physics. Chicago, IL: IRWIN.
   Google Scholar
• Jolai, F., M. Rabiee, and H. Asefi. 2012. “A Novel Hybrid Meta-heuristic Algorithm for a No-wait Flexible Flow Shop Scheduling Problem with Sequence Dependent Setup Times.” International Journal of Production Research 50(24): 7447–7466.
   Web of Science ®Google Scholar
• Keilson, J. 1962. “Queues Subject to Service Interruption.” Annals of Mathematical Statistics 33: 1314–1322.
   Google Scholar
• Khintchine, A. Y. 1933. “On Mean Time of Stoppage of Machines.” Mathematiceski Sbornic 40: 119–123.
   Google Scholar
• Kingman, J. F. C. 1962. “Some Inequalities for the Queue GI/G/1.” Biometrika 49: 315–324.
   Web of Science ®Google Scholar
• Kramer, W., and M. Lagenbach-Belz. 1976. “Approximate Formulae for the Delay in the Queueing System GI/G/1.” In Proceedings of the 8th International Teletraffic Congress, 235.1–235.8, Melbourne.
   Google Scholar
• Levy, H., and L. Kleinrock. 1986. “A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition.” Operations Research 34(3): 426–436.
   Web of Science ®Google Scholar
• Lindley, D. V. 1952. “Theory of Queues with a Single Server.” Proceedings of the Cambridge Philosophical Society 48: 277–289.
   Web of Science ®Google Scholar
• Morrison, J., and D. Martin. 2007. “Practical Extensions to Cycle Time Approximations for the G/G/M-queue with Applications.” IEEE Transactions on Automation Science and Engineering 4(4): 523–532.
   Web of Science ®Google Scholar
• Mousavi, S. M., M. Zandieh, and M. Amiri. 2011. “Comparisons of Bi-objective Genetic Algorithms for Hybrid Flowshop Scheduling with Sequence-dependent Setup Times.” International Journal of Production Research 50(10): 2570–2591.
   Web of Science ®Google Scholar
• Neuts, M., and D. Lucantoni. 1979. “A Markovian Queue with N Servers Subject to Breakdowns and Repair.” Management Science 25(9): 849–861.
   Web of Science ®Google Scholar
• Newell, G. F. 1979. Approximate Behavior of Tandem Queues. New York: Springer.
   Google Scholar
• Pickardt, C. W., and J. Branke. 2012. “Setup-oriented Dispatching Rules – A Survey.” International Journal of Production Research 50(20): 5823–5842.
   Web of Science ®Google Scholar
• SEMI E10. 2001. “Specification for Definition and Measurement of Equipment Reliability, Availability, and Maintainability.” In Book of SEMI Standards, edited by Semiconductor Equipment and Materials International. Mountain View, CA: SEMI.
   Google Scholar
• Sengupta, B. 1990. “A Queue with Service Interruptions in an Alternating Random Environment.” Operations Research 38(2): 308–318.
   Web of Science ®Google Scholar
• Smith, W. L. 1953. “Distribution of Queueing Times.” Proceedings of the Cambridge Philosophical Society 49: 449–461.
   Google Scholar
• Stecke, K., and J. Aronson. 1985. “Review of Operator/Machine Interference Models.” International Journal of Production Research 23(1): 129–151.
   Web of Science ®Google Scholar
• Takagi, H. 1988. “Queuing Analysis of Polling Models.” ACM Computing Surveys 20(1): 5–28.
   Web of Science ®Google Scholar
• Takagi, H. 2000. “Analysis and Application of Polling Models.” In Performance Evaluation: Origins and Directions, edited by G. Haring, C. Lindemann, and M. Reiser, 423–442. New York: Springer.
   Google Scholar
• Thiruvengadam, K. 1963. “Queuing with Breakdowns.” Operations Research 11(1): 62–71.
   Web of Science ®Google Scholar
• Welch, P. 1964. “On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service.” Operations Research 12(5): 736–752.
   Web of Science ®Google Scholar
• White, H., and L. Christie. 1958. “Queueing with Preemptive Priorities or with Breakdown.” Operations Research 6: 79–95.
   Web of Science ®Google Scholar
• Wu, K., and K. Hui. 2008. “The Determination and Indetermination of Service Times in Manufacturing Systems.” IEEE Transactions on Semiconductor Manufacturing 21(1): 72–82.
   Web of Science ®Google Scholar
• Wu, K., and L. F. McGinnis. 2013. “Interpolation Approximations for Queues in Series.” IIE Transactions 45(3): 273–290.
   Web of Science ®Google Scholar
• Wu, K., L. F. McGinnis, and B. Zwart. 2008. “Queueing Models for Single Machine Manufacturing Systems with Interruptions.” In Winter Simulation Conference, 2083–2092, Miami, FL.
   Google Scholar
• Wu, K., L. F. McGinnis, and B. Zwart. 2011. “Queueing Models for a Single Machine Subject to Multiple Types of Interruptions.” IIE Transactions 43(10): 753–759.
   Web of Science ®Google Scholar