An effective heuristic algorithm for the partial shop scheduling problem

摘要

In a partial shop scheduling problem the operations of each job have to respect a partial order, which can be different for each job. We study the problem of finding a solution of minimal makespan in partial shops. This problem generalizes many problems which have been studied independently in the literature, such as the group shop scheduling problem, the mixed shop scheduling problem, and the open shop scheduling problem. In this paper we propose an algorithm which is able to find solutions for the partial shop scheduling problem. In computational experiments we find that the proposed single heuristic can compete with the state-of-the-art heuristics for the partial shop, group shop, mixed shop, and open shop, and in many cases, improves the state of the art. The main contribution of this paper is the demonstration that a single algorithm can solve effectively many special cases of the partial shop without taking into consideration their particular structure. We highlight the contribution of the main novel components of the algorithm, namely the initial solution generator, neighbourhood structure, and the lower bound for new solutions generated by such neighbourhood. (C) 2018 Elsevier Ltd. All rights reserved.