Author： Gao Jian Chen Rong Deng Wu
Publisher： Taylor & Francis Ltd
ISSN： 0020-7543
Source： International Journal of Production Research, Vol.51, Iss.3, 2013-02, pp. : 641-651
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Distributed permutation flow shop scheduling problem (DPFSP) is a newly proposed scheduling problem, which is a generalisation of classical permutation flowshop scheduling problem. Studies on algorithms for solving this problem are in the early stage. In this paper, we propose a new tabu algorithm for solving this problem, which exploits a novel tabu strategy. A method that swaps sub-sequences of jobs is presented to generate neighbourhood. Moreover, an enhanced local search method is proposed and also combined into the tabu algorithm. We also use the well-known benchmark of Taillard (extended to the distributed permutation flowshop problems) to test the algorithm. From the intensive experiments we carried out, we conclude that the proposed tabu algorithm outperforms all the existing algorithms including heuristics algorithms (i.e. NEH1, NEH2, VND(a) and VND(b)) and a hybrid genetic algorithm, so the best-known solutions for 472 instances are updated. Moreover, it is worth mentioning that the efficiency of the tabu algorithm is also better than that of the genetic algorithm.
Related content
Access to resources
Recommend
Parallel flowshop scheduling using Tabu search
International Journal of Production Research, Vol. 41, Iss. 13, 2003-09 ,pp. :