A scheduling model for the refurbishing process in recycling management

• Published in: International journal of production research Vol. 51; no. 23-24; pp. 7120 - 7139
• Main Authors: Cheng, T.C.E., Lin, B.M.T., Tian, Y.
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 18.11.2013; Taylor & Francis LLC
• Subjects: Algorithms; approximation algorithm; Assignment problem; Heuristic; Job shops; Management; Mathematical models; operation-based performance measure; Optimization; Production scheduling; Recycling; Refurbishing; refurbishing flowshop; Schedules; Scheduling; Studies; weighted total completion time
• ISSN: 0020-7543; 1366-588X
• DOI: 10.1080/00207543.2013.842024

We propose from the perspective of operations scheduling a novel model of the refurbishing process in recycling management. We model the refurbishing process as a two-stage flowshop that dismantles products into parts in stage one and refurbishes the parts on dedicated machines in stage two. The model also features that the performance measure of a schedule is defined by operation-based completion times, which is different from the job-based performance measures traditionally adopted in the scheduling literature. We analyse the optimality properties and computational complexity of some special cases of the problem. We derive lower bounds on the optimal solution based on a disaggregation technique and the assignment problem, and develop dominance rules incorporating estimates of the effects of partial schedules on unscheduled jobs. We present a heuristic approach, based on LP relaxation, and analyse its performance ratio. We also develop two metaheuristic algorithms, based on iterated local search and ant colony optimisation, to produce approximate solutions. The results of computational experiments show that the metaheuristics generate better solutions than the simple weighted shortest processing time dispatching rule, and the NEH-based and CDS-based algorithms, which are commonly deployed to treat the classical two-machine flowshop scheduling problem.