Performance of static priority rules for shared facilities in a remanufacturing shop with disassembly and reassembly

被引:34
作者
Guide, VDR [1 ]
Souza, GC
van der Laan, E
机构
[1] Penn State Univ, Dept Supply Chains & Informat Syst, Smeal Coll Business Adm, University Pk, PA 16802 USA
[2] Univ Maryland, Robert H Smith Sch Business, College Pk, MD 20742 USA
[3] Erasmus Univ, Fac Business Adm, NL-3000 DR Rotterdam, Netherlands
关键词
manufacturing; production; remanufacturing; queuing;
D O I
10.1016/j.ejor.2003.12.015
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we propose a stylized model of a basic remanufacturing shop that handles two remanufacturable products. Product A is comprised of two components A1 and A2, whereas product B is a single entity. After disassembly, component A1 is remanufactured at facility F1; component A2 and product B are remanufactured at facility F2. Both remanufacturing facilities have limited capacity, and are modeled as M/G/1 queues. First, we argue that, under the assumptions of our model, delaying a component to the shop after disassembly, which is a common release mechanism in actual shops, never improves system performance, measured in terms of total weighted average sojourn time (TWAST). Second, we show that the constrained optimal scheduling rule at facility F2 (constrained to simple non-preemptive static priority rules) that minimizes TWAST depends on the processing time characteristics of A1, A2, and B, and can only be found numerically, in general. Using an extensive numerical study based on a numerical approximation for product A's average sojourn time, we show, however, that using FCFS as a scheduling rule at F2 achieves similar TWAST performance, with an average increase of only 7.5%. We also perform a simulation study and show that a two-moment approximation for product A's average sojourn time performs well except for a narrow utilization band. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:341 / 353
页数:13
相关论文
共 20 条
[1]  
[Anonymous], 1983, REMANUFACTURING US E
[2]   THE FORK-JOIN QUEUE AND RELATED SYSTEMS WITH SYNCHRONIZATION CONSTRAINTS - STOCHASTIC ORDERING AND COMPUTABLE BOUNDS [J].
BACCELLI, F ;
MAKOWSKI, AM ;
SHWARTZ, A .
ADVANCES IN APPLIED PROBABILITY, 1989, 21 (03) :629-660
[3]  
Buzacott J.A., 1993, STOCHASTIC MODELS MA
[4]  
Conway R.W., 1967, Theory of Scheduling
[5]   2 PARALLEL QUEUES CREATED BY ARRIVALS WITH 2 DEMANDS .1. [J].
FLATTO, L ;
HAHN, S .
SIAM JOURNAL ON APPLIED MATHEMATICS, 1984, 44 (05) :1041-1053
[6]  
Fleischmann M, 2000, Quantitative models for Reverse Logistics
[7]  
Gross D., 1998, Fundamentals of queueing theory, V3
[8]   Scheduling policies for remanufacturing [J].
Guide, VDR ;
Kraus, ME ;
Srivastava, R .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 48 (02) :187-204
[9]  
Guide VDR, 1998, J OPER MANAG, V16, P551, DOI 10.1016/S0272-6963(97)00024-7
[10]   Buffering from material recovery uncertainty in a recoverable manufacturing environment [J].
Guide, VDR ;
Srivastava, R .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1997, 48 (05) :519-529