`a`
Journal of Industrial and Management Optimization (JIMO)
 

On the multi-server machine interference with modified Bernoulli vacation
Pages: 1191 - 1208, Issue 4, October 2014

doi:10.3934/jimo.2014.10.1191      Abstract        References        Full text (761.5K)           Related Articles

Tzu-Hsin Liu - Department of Applied Statistics, National Taichung University of Science and Technology, Taichung, 404, Taiwan (email)
Jau-Chuan Ke - Department of Applied Statistics, National Taichung University of Science and Technology, Taichung, 404, Taiwan (email)

1 F. Benson and D. R. Cox, The productivity of machine requiring attention at random intervals, Journal of the Royal Statistical Society B, 13 (1951), 65-82.
2 E. K. P. Chong and S. H. Zak, An Introduction of Optimization, 2nd edition, John Wiley and Sons, New Jersey, 2001.
3 G. Choudhury, A two-stage batch arrival queueing system with a modified Bernoulli schedule vacation under N-policy, Mathematical and Computer Modeling, 42 (2005), 71-85.       
4 G. Choudhury and K. Deka, An $M^X/G/1$ unreliable retrial queue with two phases of service and Bernoulli admission mechanism, Applied Mathematics and Comutation, 215 (2009), 936-949.       
5 G. Choudhury and K. C. Madan, A two phase batch arrival queueing system with a vacation time under Bernoulli schedule, Applied Mathematics and Computation, 149 (2004), 337-349.       
6 G. Choudhury and L. Tadj, The optimal control of an $M^X/G/1$ unreliable server queue with two phases of service and Bernoulli vacation schedule, Mathematical and Computer Modelling, 54 (2011), 673-688.       
7 B. T. Doshi, Queueing systems with vacations - a survey, Queueing Systems, 1 (1986), 29-66.       
8 S. M. Gupta, Machine interference problem with warm spares, server vacations and exhaustive service, Performance Evaluation, 29 (1997), 195-211.
9 J. C. Ke, Vacation policies for machine interference problem with an unreliable server and state-dependent service rate, Journal of the Chineses Institute of Industrial Engineers, 23 (2006), 100-114.
10 J. C. Ke, S. L. Lee and C. H. Liou, Machine repair problem in production systems with spares and server vacations, RAIRO-Operations Research, 43 (2009), 35-54.       
11 J. C. Ke and C. H. Lin, A Markov repairable system involving an imperfect service station with multiple vacations, Asia-Pacific Journal of Operational Research, 22 (2005), 555-582.       
12 J. C. Ke and K. H. Wang, Vacation policies for machine repair problem with two type spares, Applied Mathematical Modelling, 31 (2007), 880-894.
13 J. C. Ke, C. H. Wu and W. L. Pearn, Algorithmic analysis of the multi-server system with a modified Bernoulli vacation schedule, Applied Mathematical Modelling, 35 (2011), 2196-2208.       
14 J. C. Ke, C. H. Wu and Z. Zhang, Recent developments in vacation queueing models: A short survey, International Journal of Operations Research, 7 (2010), 3-8.
15 K. C. Madan, W. Abu-Dayyeh and F. Taiyyan, A two server queue with Bernoulli schedules and a single vacation policy, Applied Mathematics and Computation, 145 (2003), 59-71.       
16 R. Oliva, Tradeoffs in responses to work pressure in the service industry, California Management Review, 30 (2001), 26-43.
17 B. Raphael and I. F. C. Smith, A direct stochastic algorithm for global search, Journal of Applied Mathematics and Computation, 146 (2003), 729-758.       
18 L. Tadj, G. Choudhury and C. Tadj, A quorum queueing system with a random setup time under N-policy and with Bernoulli vacation schedule, Quality Technology and Quantitative Management, 3 (2006), 145-160.       
19 H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vacation and Priority Systems. part I, vol. 1, North-Holland, Amsterdam, 1991.       
20 N. Tian and Z. G. Zhang, Vacation Queueing Models: Theory and Applications, Springer-Verlag, New York, 2006.       
21 K. H. Wang, W. L. Chen and D. Y. Yang, Optimal management of the machine repair problem with working vacation: Newton's method, Journal of Computational and Applied Mathematics, 233 (2009), 449-458.       

Go to top