Abstract
This paper deals with decision making in a remanufacturing facility where returned products arrive according to a Poisson process. Arrivals have different routings among the facility stations since they have different defects and need different operations. A returned product is either accepted for remanufacturing or sold at a salvage value without working on it in order to reduce congestion. The authors provide an analytical model using a queuing network theory to obtain the best policy for accepting returned products. Furthermore, a continuous genetic algorithm is implemented to solve the model, which happens to be a mixed integer nonlinear programming problem. Several examples are solved by the implemented genetic algorithm and the results are evaluated.
Similar content being viewed by others
References
Fleischmann M, Bloemhof-Ruwaard JM, Dekker R, Van Der Laan E, Van Nunen JAEE, Van Wassenhove LN (1997) Quantitative models for reverse logistics: a review. Eur J Oper Res 103(1):1–17
Laan EA, van der Teunter RH (2006) Simple heuristics for push and pull remanufacturing policies. European Journal of Operational Research 175(2):1084–1102
Guide VD, Gunes ED, Souza GC, van Wassenhove LN (2008) The optimal disposition decision for product returns. Oper Manag Res 1:6–14
Guide VDR Jr, Souza GC, VanWassenhove LN, Blackburn J (2006) Time value of commercial product returns. Manage Sci 52:1200–1214
Franke C, Basdere B, Ciupek M, Seliger S (2006) Remanufacturing of mobile phones—capacity, program and facility adaptation planning. Omega 34(6):562–570
Guide VDR Jr, Jayaraman V, Srivastava R (1999) Production planning and control for remanufacturing: a state of the art survey. Robot Comput-Integr Manuf 15:221–230
Toktay LB, Wein LM, Zenios SA (2000) Inventory management of remanufacturable products. Manage Sci 46(11):1412–1426
Bayindir ZP, Erkip N, Güllü R (2003) A model to evaluate inventory costs in a remanufacturing environment. Int J Prod Econ 81–82:597–607
Souza GC, Ketzeberg ME, Guide VDR (2002) Capacitated remanufacturing with service level constraints. Prod Oper Manag 11:232–248
Souza GC, Ketzeberg ME (2002) Two-state make-to-order remanufacturing with service-level constraints. Int J Prod Res 40(2):477–493
Ketzenberg ME, Souza GC (2003) Mixed assembly and disassembly operations for remanufacturing. Prod Oper Manag 12(3):321–335
Vorasayan J, Ryan SM (2006) Optimal price and quantity for refurbished products. Production and Operations Management 15:369–383
Kris L, Nico V (2007) Reverse logistics network design with stochastic lead times. Comput Oper Res 34(2):395–416
Aksoy HK, Gupta SM (2005) Buffer allocation plan for a remanufacturing cell. Comput Ind Eng 48:657–677
Demirel NÖ, Gökçen H (2008) A mixed integer programming model for remanufacturing in reverse logistics environment. Int J Adv Manuf Technol 39:1197–1206
Bolch G, Greiner S, de Meer H, Trivedi KS (2006) Queueing networks and Markov chains: modeling and performance evaluation with computer science applications, 2nd edn. Wiley, New York
Baskett F, Chandy K, Muntz R, Palacios F (1975) Open, closed, and mixed networks of queues with different classes of customers. J ACM 22(2):248–260
Haupt RL, Haupt SE (2004) Practical genetic algorithms, 2nd edn. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Karamouzian, A., Teimoury, E. & Modarres, M. A model for admission control of returned products in a remanufacturing facility using queuing theory. Int J Adv Manuf Technol 54, 403–412 (2011). https://doi.org/10.1007/s00170-010-2933-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-010-2933-7