Advanced search
Publication Cover
Quality Technology & Quantitative Management Volume 8, 2011 - Issue 3
Submit an article Journal homepage
37
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

The Interrelationship Between N-policy M/G/1/K and F-policy G/M/1/K Queues with Startup Time

Ching-Chang KuoUnihan Corporation, Hsinchu, TaiwanView further author information
,
Kuo-Hsiung WangDepartment of Business Administration, Asia University, Taichung, TaiwanView further author information
&
W. L. PearnDepartment of Industrial Engineering and Management, National Chiao Tung University, Hsinchu, TaiwanView further author information
Pages 237-251 | Received 01 May 2008, Accepted 01 Nov 2009, Published online: 09 Feb 2016

References

  • Baker, K. R. (1973). A note on operating policies for the queue M/M/1 with exponential startups. INFOR, 11, 71–72.
  • Bell, C. E. (1971). Characterization and computation of optimal policies for operating an M/G/1 queueing system with removable server. Operations Research, 19, 208–218.
  • Bell, C. E. (1972). Optimal operation of an M/G/1 priority queue with removable server. Operations Research, 21, 1281–1289.
  • Borthahur, A., Medhi, J. and Gohain, R. (1987). Poisson in put queueing systems with startup time and under control operating policy. Computers and Operations Research, 14, 33–40.
  • Gupta, S. M. (1995). Interrelationship between controlling arrival and service in queueing systems. Computers and Operations Research, 22, 1005–1014.
  • Heyman, D. P. (1968). Optimal operating policies for M/G/1 queuing system. Operations Research, 16, 362–382.
  • Hur, S. and Paik, S. J. (1999). The effect of different arrival rates on the N-policy of M/G/1 with server setup. Applied Mathematical Modelling, 23, 289–299.
  • Ke, J. C. and Wang, K. H. (2002). A recursive method for N-policy G/M/1 queueing system with finite capacity. European Journal of Operational Research, 142, 577–594.
  • Ke, J. C. (2003). The operating characteristic analysis on a general input queue with N-policy and a startup time. Mathematical Methods of Operations Research, 57, 235–254.
  • Kimura, T. (1981). Optimal control of an M/G/1 queueing system with removable server via diffusion approximation. European Journal of Operational Research, 8, 390–398.
  • Lee, H. W. and Park, J. O. (1997). Optimal strategy in N-policy production system with early set-up. Journal of the Operational Research Society, 48, 306–313.
  • Medhi, J. and Templeton, J. G. C. (1992). A Poisson input queue under N-policy and with a general start up time. Computers and Operations Research, 19, 35–41.
  • Takagi, H. (1993). A M/G/1/K queues with N-policy and setup times. Queueing Systems, 14, 79–98.
  • Teghem, J. Jr. (1987). Optimal control of a removable server in an M/G/1 queue with finite capacity. European Journal of Operational Research, 31, 358–367.
  • Wang, K. H. and Ke, J. C. (2000). A recursive method to the optimal control of an M/G/1 queueing system with finite capacity and infinite capacity. Applied Mathematical Modelling, 24, 899–914.
  • Wang, K. H., Kuo, C. C. and Pearn, W. L. (2007). Optimal control of an M/G/1 queueing system with F-policy and startup time. Journal of Optimization Theory and Application, 135, 285–299.
  • Wang, K. H., Kuo, C. C. and Pearn, W. L. (2008). A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time. Applied Mathematical Modelling, 32, 958–970.
  • Yadin, M. and Naor, P. (1963). Queueing systems with a removable service station. Operations Rsearch Quarterly, 14, 393–40.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.