figshare
Browse
geno_a_1391240_sm6158.pdf (110.8 kB)

Discrete harmony search algorithm for scheduling and rescheduling the reprocessing problems in remanufacturing: a case study

Download (110.8 kB)
journal contribution
posted on 2017-11-06, 11:58 authored by Kaizhou Gao, Ling Wang, Jianping Luo, Hua Jiang, Ali Sadollah, Quanke Pan

In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor.

Funding

This study is supported by the National Key R&D Program of China [number 2016YFB0901900], National Natural Science Foundation of China [grant number 61603169] and National Natural Science Fund for Distinguished Young Scholars of China [grant number 61525304].

History