Abstract
This paper deals with the dynamic routing of product returns in distinguishable parallel queues. Several vendors alongside an original equipment manufacturer are available in provision of remanufacturing service. Each has its own queue. The stream of the product returns follow a stochastic process. A central controller is employed to decide to which vendor an incoming product is sent to avoid excessive queues in front of some vendors and idle servers in the others. We develop models and index-based heuristics to support the dynamic routing decisions so as to minimize the overall recovering costs. The product concerned exemplifies a short-life cycle due to, for example, technology advance. Long delay during the remanufacturing process will render a substantial deterioration of reselling prices. Hence, in the paper we contend that the cost incurred for remanufacturing a product should take explicit account of the impact of long delays in the lead time. Both theoretical and simulation studies demonstrate the effectiveness of the Restless Bandit approach deployed to the dynamic routing of product returns among multiple vendors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ansell PS, Dacre MJ, Glazebrook KD, Kirkbride C (2001) Optimal load balancing and scheduling in distributed multi-class service system. Technical Report, Newcastle University
Archibald TW, Black D, Glazebrook KD (2009) Indexability and index heuristics for a simple class of inventory routing problems. Oper Res 57: 314–326
Argon NT, Ding L, Glazebrook KD, Ziya S (2009) Dynamic routing of customers with general delay costs in a multi-server queueing system. Prob Eng Inf Sci 23(2):175–203
Ding L, Glazebrook KD, Kirkbride C (2008) Allocation models and heuristics for the outsourcing of repairs for a dynamic warranty population. Manag Sci 54(3): 594–607
Dowlatshahi S (2005) A strategic framework for the design and implementation of remanufacturing operations in reverse-logistics. Int J Prod Res 43(16): 3455–3480
Ephremides A, Varaiya P, Walrand J (1980) A simple dynamic routing problem. IEEE Trans Autom Control 25(4): 690–693
Fargher, JSW Jr (ed) (1996) Remanufacturing Resource Book. APICS, Falls Church
Foley RD, McDonald DR (2001) Join the shortest queue stability and exact asymptotics. Ann Appl Prob 11: 569–607
Glasser GJ (1962) Variance formulas for the mean difference and coefficient of concentration. J Am Stat Assoc 57(299): 648–654
Glazebrook KD, Kirkbride C, Ouenniche J (2009) Index policies for the admission control and routing of impatient customers to heterogeneous service stations. Oper Res 57: 975–989
Glazebrook KD, Mitchell HM, Ansell PS (2005) Index policies for the maintenance of a collection of machines by a set of repairmen. Eur J Oper Res 165: 267–284
Glazebrook KD, Niño-Mora J, Ansell PS (2002) policies for a class of discounted restless bandit problem. Adv Appl Prob 34(4): 754–774
Guide D, Harrison T, Wassenhove LNV (2003) The challenge of closed loop supply chains. Interfaces 33(6): 3–6
Hordijk A, Koole G (1990) On the optimality of the generalised shortest queue policy. Prob Eng Inf Sci 4: 477–487
Hordijk A, Koole G (1992) On the assignment of customers to parallel queues. Prob Eng Inf Sci 6: 495–511
Houck DJ (1987) Comparison of policies for routing customers to parallel queueing systems. Oper Res 35: 306–310
Johri PK (1989) Optimality of the shortest line discipline with state-dependent service rates. Eur J Oper Res 41: 157–161
Kleindorfe PR, Singhal K, Van Wassenhove LN (2005) Sustainable operations management. Prod Oper Manag 14(4): 482–492
Krikke H (1998) Partnerships in reverse logistics: Or-model building in view of practical developments. Network
Majumder P, Groenevelt H (2001) Competition in remanufacturing. Prod Oper Manag 10(2): 125–141
Menich B, Serfozo R (1991) Optimality of routing and servicing in dependent parallel processing systems. Queueing Syst 9: 403–418
Michaud C, Llerena D (2006) An economic perspective on remanufactured products industrial and consumption challenges for life cycle engineering. Proc LCE2006
Niño-Mora J (2001) Restless bandits partial conservation laws and indexability. Adv Appl Prob 33: 76–98
Niño-Mora J (2002) Dynamic allocation indices for restless projects and queueing admission control a polyhedral approach. Math Program Ser A 93: 361–413
Opp M, Glazebrook KD, Kulkarni V (2005) Outsourcing warranty repairs—dynamic allocation. Nav Res Logist 52: 381–398
Papadimitriou CH, Tsitsiklis JN (1999) The complexity of optimal queueing network control. Math Oper Res 24(2): 293–305
Ross SM (1983) Introduction to Stochastic Dynamic Programming. Academic Press, New York
Sen A (1973) On economic inequality. Clarendon, Oxford
Stolyar AL (2005) Optimal routing in output-queued flexible server systems. Prob Eng Inf Sci 19: 141–189
Subramoniam R, Huisingh D, Chinnam RB (2009) Remanufacturing for the automotive aftermarket-strategic factors literature review and future research needs. J Cleaner Prod 17(13): 1163–1174
Thorn BK, Rogerson P (2002) Take it back. IIE Solut 34(4): 34–40
Tijms HC (1994) Stochastic models: an algorithmic approach. Wiley, Chichester
Weber RR (1978) On the optimal assignment of customers to parallel queues. J Appl Prob 15: 406–413
Weber RR, Weiss G (1990) On an index policy for restless bandits. J Appl Prob 27: 637–648
Whitt W (1986) Deciding which queue to join some counterexamples. Oper Res 34: 55–62
Whittle P (1988) Restless bandits activity allocation in a changing world. J Appl Prob special vol 25: 287–298
Whittle P (1996) Optimal Control: Basics and Beyond. Wiley, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ding, L., Glazebrook, K.D. Dynamic routing in distinguishable parallel queues: an application of product returns for remanufacturing. OR Spectrum 35, 585–608 (2013). https://doi.org/10.1007/s00291-012-0293-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-012-0293-4