Title of article
Near optimal buffer allocation in remanufacturing systems with N-policy
Author/Authors
H. K?vanç Aksoy a، نويسنده , , 1، نويسنده , , Surendra M. Gupta، نويسنده , , *، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
13
From page
496
To page
508
Abstract
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 (P1). 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.
Keywords
Queueing networks , Throughput , Buffer allocation , N-policy , Performance evaluation , Remanufacturing
Journal title
Computers & Industrial Engineering
Serial Year
2010
Journal title
Computers & Industrial Engineering
Record number
925961
Link To Document