23.12.2014 Views

OCTOBER 19-20, 2012 - YMCA University of Science & Technology

OCTOBER 19-20, 2012 - YMCA University of Science & Technology

OCTOBER 19-20, 2012 - YMCA University of Science & Technology

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Proceedings <strong>of</strong> the National Conference on<br />

Trends and Advances in Mechanical Engineering,<br />

<strong>YMCA</strong> <strong>University</strong> <strong>of</strong> <strong>Science</strong> & <strong>Technology</strong>, Faridabad, Haryana, Oct <strong>19</strong>-<strong>20</strong>, <strong>20</strong>12<br />

c) Scheduling and dispatch <strong>of</strong> war material <strong>of</strong> special nature based on operational needs.<br />

d) Scheduling <strong>of</strong> service facilities in a repair and maintenance workshop.<br />

e) Scheduling <strong>of</strong> overhaul <strong>of</strong> used engines and other assemblies <strong>of</strong> aircrafts, missile systems, transport fleet<br />

etc.<br />

f) Scheduling <strong>of</strong> limited transport fleet to a large number <strong>of</strong> users.<br />

g) Scheduling <strong>of</strong> landing and take <strong>of</strong>f from airports with heavy duty <strong>of</strong> air traffic and air facilities.<br />

h) Decision <strong>of</strong> replacement <strong>of</strong> plant, machinery, special maintenance tools and other equipment base on<br />

different criteria.<br />

Special benefits which this technique enjoys in solving problems such as above are<br />

1) Queueing theory attempts to solve problems based on a scientific understanding <strong>of</strong> the problems<br />

and solving them in optimal manner so that facilities are fully utilized and waiting time is reduced<br />

to minimum possible.<br />

2) Waiting time (or queueing) theory models can recommend arrival <strong>of</strong> customers to be serviced,<br />

setting up <strong>of</strong> workstations, requirement <strong>of</strong> manpower etc. based on probability theory.<br />

Limitations <strong>of</strong> Queueing Theory<br />

Though queueing theory provides us a scientific method <strong>of</strong> understanding the queues and solving such problems, the<br />

theory has certain limitations which must be understood while using the technique, some <strong>of</strong> these are:<br />

a) Mathematical distribution, which are assume while solving queueing theory problems , are only a close<br />

approximation <strong>of</strong> the behaviour <strong>of</strong> customers, time between their arrival and service time required by each<br />

customer.<br />

b) Most <strong>of</strong> real life queuing problems are complex situation and very difficult to use the queueing theory<br />

technique, even then uncertainty will remain.<br />

c) Many situations in industry and service are multi-channel queueing problems. When a customer has been<br />

attended to and the service provided, it may still have to get some other service from another service and<br />

may have to fall in queue once again. Here the departure <strong>of</strong> one channel queue becomes the arrival <strong>of</strong> other<br />

queue. In such situations, the problem becomes still more difficult to analyse.<br />

d) Queueing model may not be ideal method to solve certain very difficult and complex problems and one may<br />

have to resort to other techniques like Monte-Carlo simulation method.<br />

References<br />

[1] Abou El-Ata M. O., Hariri A. M. A., “The M/M/C/N queue with balking and reneging” Computers and<br />

Operations Research <strong>19</strong>, pp. 713-716, <strong>19</strong>92.<br />

[2] Ancker Jr. C. J., Gafarian A. V., “Some queueing problems with balking and reneging”, I. Operations Research<br />

11, pp. 88-100, <strong>19</strong>63.<br />

[3] Ancker Jr. C. J., Gafarian A. V., “Some queueing problems with balking and reneging”, II. Operations Research<br />

11, pp. 928-937, <strong>19</strong>63.<br />

[4] Ancker Jr. C. J., Gafarian A. V., "Queueing with Impatient Customers who Leave at Random", J. Indust. Eng. 13,<br />

pp. 86-87, <strong>19</strong>62.<br />

[5] Ancker Jr. C. J., Gafarian A. V., "Queueing with Reneging and Multiple Hetero-geneous servers”, Naval Res.<br />

Log. Quart. 10, pp. 137-139, <strong>19</strong>63.<br />

[6]. Ancker Jr. C. J., Gafarian A. V., "Queuing with Reneging and Multiple Heterogeneous Servers", SP-372,<br />

System Development Corporation, pp. 16-18, <strong>19</strong>61.<br />

[7] Avi-Itzhak B., Naor P., “Some queueing problems with the service station subject to breakdown”, Oper. Res., 11,<br />

pp. 303-3<strong>20</strong>, <strong>19</strong>63.<br />

[8] Barrer D.Y., “Queuing with impatient customers and ordered service”, Oper. Res. 5, pp. 650-656, <strong>19</strong>57.<br />

[9] Bbocmeyer E., Halstrom H. L., Jensen A., “The Life and Works <strong>of</strong> A. K. Erlang”, Copenhagen Telephone<br />

Company, <strong>19</strong>48.<br />

[10] Boots N.K., Tijms H., “A multiserver queueing system with impatient customers”,Management Sci. 45, pp. 444-<br />

448, <strong>19</strong>99.<br />

[11] Choi B.D., Kim B., Chung J., “M/M/1 queue with impatient customers <strong>of</strong> higher priority”, Queueing Systems<br />

38, pp. 49-66. <strong>20</strong>01.<br />

[12] Crommelin C. D., “Delay Probability Formulae When the Holding Times Are Constant”, P. O. Elec. Eng. J. 25,<br />

pp. 41-50, <strong>19</strong>32.<br />

909

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!