Asymptotic behavior of the expansion method for open finite queueing networks
Computers and Operations Research
The role of work-in-process inventory in serial production lines
Operations Research
Buffer space allocation in automated assembly lines
Operations Research
A Poisson input queue under N-policy and with a general start up time
Computers and Operations Research
Open finite queueing networks with M/M/C/K parallel servers
Computers and Operations Research
Buffer allocation for an integer nonlinear network design problem
Computers and Operations Research
A methodology for analyzing finite buffer tandem manufacturing systems with N-policy
Computers and Industrial Engineering
Buffer allocation in unreliable production lines using a knowledge based system
Computers and Operations Research
Issues in environmentally conscious manufacturing and product recovery: a survey
Computers and Industrial Engineering - Special issue on o/perational issues in environmentally conscious manufacturing
Computers and Operations Research
Quality Engineering Using Robust Design
Quality Engineering Using Robust Design
Modified N-policy for M/G/1 queues
Computers and Operations Research
The Analysis of a General Input Queue with N Policy and Exponential Vacations
Queueing Systems: Theory and Applications
Isolation Method in a Network of Queues
IEEE Transactions on Software Engineering
Transient solution of a multiserver Poisson queue with N-policy
Computers & Mathematics with Applications
Buffer allocation plan for a remanufacturing cell
Computers and Industrial Engineering - Special issue: Group technology/cellular manufacturing
On the quality variation impact of returns in remanufacturing
Computers and Industrial Engineering
| Hi-index | 0.01 |
We introduce a near optimal buffer allocation plan (NOBAP) specifically developed for a cellular remanufacturing system with finite buffers where the servers follow N-policy. The term N-policy is used for the situation where the server leaves primary work to tend to an external workload assigned to him (such as processing additional tasks or performing preventive maintenance of equipments) every time the server becomes idle and does not return back to his primary work until the queue size in front of the primary work reaches a threshold value of N (=1). The remanufacturing system considered here consists of three modules, viz., the disassembly module for returned products, the testing module and the remanufacturing module. In order to analyze the system we propose an algorithm that uses an open queueing network, decomposition principle and expansion methodology. The buffer allocation algorithm distributes a given number of available buffer slots among the remanufacturing system stations to optimize the system's performance. The algorithm has been rigorously tested using a variety of experimental conditions. From the results, it is clear that the algorithm's performance is robust, consistent and produces excellent results.