Outsourcing and rescheduling for a two-machine flow shop with the disruption of new arriving jobs: A hybrid variable neighborhood search algorithm

• Published in: Computers & industrial engineering Vol. 130; pp. 198 - 221
• Main Author: Liu, Le
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.04.2019
• Subjects: Outsourcing; Rescheduling; Two-machine flow shop; Variable neighborhood search; Rescheduling; Outsourcing; Variable neighborhood search; Two-machine flow shop
• ISSN: 0360-8352; 1879-0550
• DOI: 10.1016/j.cie.2019.02.015

•The two-machine flow shop outsourcing and rescheduling problem against the disruption of new arriving jobs is addressed.•A hybrid variable neighborhood search (HVNS) algorithm is developed for solving this problem.•Two constructive heuristics are designed to generate the initial solutions for the HVNS.•Extensive computational results and comparisons confirm the effectiveness of the calibrated HVNS. This paper addresses the two-machine flow shop outsourcing and rescheduling problem (TFSORP) in response to an unexpected arrival of new jobs, in which each job can be processed in the in-house shop or outsourced to a single subcontractor. An efficient schedule is constructed for the in-house jobs, and its performance is measured by the makespan. Each of the outsourced jobs requires paying an outsourcing cost. The objective is to minimize the sum of the in-house makespan and total outsourcing cost, subject to a limit on the number of original jobs processed by the subcontractor after disruption. To solve this NP-hard problem, a mixed integer programming formulation and helpful optimization properties are first established, and then a hybrid variable neighborhood search algorithm (HVNS) that incorporates one-dimensional array representation and three problem-specific neighborhood structures is developed. At the initialization stage, either of two well-designed constructive heuristics, i.e., job addition heuristic (JAH) and job removal heuristic (JRH) is employed. At the iterative search stage, an adaptive best-improvement procedure based on three neighborhood structures is devised to play the role of local search. An extensive experimental calibration for main factors in HVNS is carried out by a full-factorial design of experiments. To validate the calibrated HVNS, computational experiments are conducted upon the test suite of various instances. As demonstrated in the results, the calibrated HVNS gains the advantage over both the commercial optimizer and exhaustive approach in terms of computation time for small-sized instances, while it also outperforms an existing meta-heuristic algorithm and two canonical ones (based on the principles of genetic algorithm and simulated annealing) in the optimizing capability.