Tailoring customer order scheduling search algorithms

摘要

Customer Order Scheduling Problem (COSP) with minimisation of the total completion time as the objective is NP-Hard. COSP has many applications that include the pharmaceutical and the paper industries. However, most existing COSP algorithms struggle to find very good solutions in large-sized problems. One key reason behind is that those algorithms are based on generic templates and as such lack problem specific structural knowledge. In this paper, we capture such knowledge in the form of heuristics and then embed those heuristics within constructive and perturbative search algorithms. In the proposed deterministic constructive search algorithm, we use processing times in various ways to obtain initial dispatching sequences that are later used in prioritising customer orders during search. We also augment the construction process with solution exploration. In the proposed stochastic perturbative search, we intensify its diversification phase by prioritising rescheduling of customer orders that are affected badly. Our tailoring of the search in this case is to make informed decisions when the search has lost its direction. On the contrary to that, in the intensification phase, we then take diversifying measures and use multiple neighbourhood operators randomly so that the search does not get stuck very quickly. Our experimental results show that the proposed algorithms outperform existing state-of-the-art COSP algorithms. (C) 2019 Elsevier Ltd. All rights reserved.