Distributed Permutation Flowshop Scheduling Problem (DPFSP) has become a hot issue in recent years. However, DPFSP with uncertain processing times (DPFSP_UPT) has not been addressed so far although real manufacturing systems often encounter various uncertain factors which make processing times uncertain. In this paper, two local-search based metaheuristics, i.e., an Iterated Greedy algorithm (sIG) and an Iterated Local Search algorithm (sILS), are presented to solve the DPFSP_UPT with makespan criterion. A robust model of expect-risk rule is used to describe the DPFSP_UPT. A valid heuristic based on the well-known NEH heuristic is proposed to initialize sIG and sILS. An acceleration algorithm is adapted to save computational efforts. A destruction procedure with dynamic sizes is presented to enhance the exploration capability for sIG. A feature with the characteristic that small changes in the solution can preserve the properties of good solutions in the iterative process is applied by sILS. Both sIG and sILS use multiple local search methods to produce promising solutions by exploiting diverse search areas. Extensive experiments show that the proposed sIG and sILS perform significantly better than the five competing algorithms adapted in the literature, but there is no significant difference between sIG and sILS and each has its own advantages for different instances.
Read full abstract