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 条
[1]   A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times [J].
Al-Anzi, Fawaz S. ;
Allahverdi, Ali .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (01) :80-94
[2]   Heuristics for a two-stage assembly flowshop with bicriteria of maximum lateness and makespan [J].
Al-Anzi, Fawaz S. ;
Allahverdi, Ali .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (09) :2682-2689
[3]   The two-stage assembly scheduling problem to minimize total completion time with setup times [J].
Allahverdi, Ali ;
Al-Anzi, Fawaz S. .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (10) :2740-2747
[4]  
Baker K. R., 1974, Introduction to Sequencing and Scheduling"
[5]   Hybrid Genetic Algorithms for Solving Reentrant Flow-Shop Scheduling with Time Windows [J].
Chamnanlor, Chettha ;
Sethanan, Kanchana ;
Chien, Chen-Fu ;
Gen, Mitsuo .
INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2013, 12 (04) :306-316
[6]   Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line [J].
Choi, Hyun-Seon ;
Kim, Ji-Su ;
Lee, Dong-Ho .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (04) :3514-3521
[7]   Scheduling with priority dispatching rules and drum-buffer-rope in a recoverable manufacturing system [J].
Daniel, V ;
Guide, R .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 53 (01) :101-116
[8]   MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495
[9]   Scheduling policies for remanufacturing [J].
Guide, VDR ;
Kraus, ME ;
Srivastava, R .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1997, 48 (02) :187-204
[10]   A SIMULATION-MODEL OF DRUM-BUFFER-ROPE FOR PRODUCTION PLANNING AND CONTROL AT A NAVAL AVIATION DEPOT [J].
GUIDE, VDR .
SIMULATION, 1995, 65 (03) :157-168