Performance improvement of remanufacturing systems operating under N-policy

This thesis deals with N-policy M/G/1 queueing remanufacturing system with general server breakdown and start-up time, where the value of returned products exponentially deteriorates since received. The server will instantly turn on the system, but the system requires a start-up period to prepare for remanufacturing when returned products in the queue reach the value of N. Otherwise, the system keeps in turn-off status. During the remanufacturing process, the machines may break down and will return back to service immediately after repairing. The procedures that will be used to achieve the target are as follows. Firstly, the expression of cost function will be derived and solved. Next, the simulation software ProModel will be used to simulate this problem. Finally, a sensitivity analysis is used on a numerical example to show the applicability of the methodology and quality of results

Optimum cost analysis of batch service retrial queuing system with server failure, threshold and multiple vacations

The aim of this paper is to analyze the queuing model entitled to cost optimization in bulk arrival and a batch service retrial queuing system with threshold, server failure, non-disruptive service, and multiple vacations. When bulk arrival of customers find the server is busy, then all customers will join in the orbit. On the other hand, if the server is free, then batch service will be provided according to the general bulk service rule. Batch size varies from a minimum of one and a maximum of ‘b’ number of customers. Customers in the orbit seek service one by one through constant retrial policy whenever the server is in idle state. The server may encounter failure during service. If the server fails, then ‘renewal of service station’ will be considered with probability . If there is no server failure with probability in the service completion or after the renewal process and if the orbit is empty, the server then leaves for multiple vacations. The server stays on vacation until the orbit size reaches the value N. For this proposed queuing model, a probability generating function of the orbit size will be obtained by using the supplementary variable technique and various performance measures will be presented with suitable numerical illustrations. A real time application is also discussed for this system. Additionally, a cost effective model is developed for this queuing model