Priority scheduling to minimize the total tardiness for remanufacturing systems with flow-shop-type reprocessing lines

被引:30
作者
Kim, Jong-Min [1 ]
Zhou, Yi-Dong [1 ]
Lee, Dong-Ho [1 ]
机构
[1] Hanyang Univ, Dept Ind Engn, Seoul, South Korea
关键词
Remanufacturing; Flow-shop-type reprocessing lines; Scheduling; Tardiness; Priority rules; DRUM-BUFFER-ROPE; ASSEMBLY FLOWSHOP; TIME; ALGORITHMS;
D O I
10.1007/s00170-017-0057-z
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This study considers the scheduling problem in remanufacturing systems in which end-of-use/life products are separated into their components at a single disassembly workstation, then each component is reprocessed at one of parallel flow-shop-type reprocessing lines, and finally the reprocessed components are reassembled into remanufactured products at parallel reassembly workstations. The problem is to determine the sequence of products to be disassembled at the disassembly workstation, the sequence of components to be reprocessed at each workstation of the reprocessing lines, and the allocation and sequence of the products to be reassembled at each reassembly workstation for a due date-based objective of minimizing the total tardiness. A mathematical programming model is developed to represent the problem, and a priority scheduling approach is proposed for practical applications. To test performances of priority rules, simulation experiments were done on various test instances, and the results are reported. In particular, we show from additional tests that the approach proposed in this study outperforms the previous one that determines reprocessing and reassembly schedules according to the sequence of disassembling products significantly, and also, the rule combination approach that uses different priority rules on disassembly, reprocessing, and reassembly shops outperforms the single rule approach that uses the same rule over the three subsystems.
引用
收藏
页码:3697 / 3708
页数:12
相关论文
共 25 条
[11]   Scheduling using drum-buffer-rope in a remanufacturing environment [J].
Guide, VDR .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1996, 34 (04) :1081-1091
[12]   An evaluation of order release strategies in a remanufacturing environment [J].
Guide, VDR ;
Srivastava, R .
COMPUTERS & OPERATIONS RESEARCH, 1997, 24 (01) :37-47
[13]   Production planning and control for remanufacturing: industry practice and research needs [J].
Guide, VDR .
JOURNAL OF OPERATIONS MANAGEMENT, 2000, 18 (04) :467-483
[14]   Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups [J].
Kim, Ji-Su ;
Park, Jung-Hyeon ;
Lee, Dong-Ho .
ENGINEERING OPTIMIZATION, 2017, 49 (10) :1719-1732
[15]   Scheduling algorithms for remanufacturing systems with parallel flow-shop-type reprocessing lines [J].
Kim, Min-Geun ;
Yu, Jae-Min ;
Lee, Dong-Ho .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (06) :1819-1831
[16]   Material flow control and scheduling in a disassembly environment [J].
Kizilkaya, E ;
Gupta, SM .
COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (1-2) :93-96
[17]   MINIMIZING THE MAKESPAN IN THE 3-MACHINE ASSEMBLY-TYPE FLOWSHOP SCHEDULING PROBLEM [J].
LEE, CY ;
CHENG, TCE ;
LIN, BMT .
MANAGEMENT SCIENCE, 1993, 39 (05) :616-625
[18]   Hybrid flow shop scheduling: A survey [J].
Linn, R ;
Zhang, W .
COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 37 (1-2) :57-61
[19]  
LUND RT, 1984, TECHNOL REV, V87, P18
[20]   A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem [J].
Shokrollahpour, E. ;
Zandieh, M. ;
Dorri, Behrouz .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2011, 49 (11) :3087-3103