Patrolling-machine-interference Problems: A Simulation Case-studies Approach

Abstract

Because of the lack of accuracy when applying classical machine-interference theory in the textile industry without taking walking time into consideration, computer-simulation techniques were adopted as a method of studying patrolling-machine-interference problems. This paper reports three simulation case studies concerning patrolling-machine-interference problems (MlPs). It is shown that the patrolling M/D/1 analytical solution of Mack et al. provides a benchmark for various patrolling MIPs. The finding that team patrolling may not necessarily have advantages over individual patrolling suggests that queuing theory has been misused in many practical situations in which the patrolling time is improperly neglected. A new queuing discipline – the modified-shortest-distance-patrolling – discipline – is proposed, which may be particularly useful when a trade-off between the machine efficiency and the visit Interval is desirable.