Browsing by Author "Hu, XiaoLu"

Now showing 1 - 5 of 5

Citation - WoS: 7
Citation - Scopus: 8
An improved discrete artificial bee colony algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance
(IEEE Computer Society help@computer.org, 2020) Jiayang Mao; Xiaolu Hu; Quanke Pan; Zhonghua Miao; Chuangxin He; M. Fatih Tasgetiren; Tasgetiren, M. Fatih; He, Chuangxin; Mao, Jiayang; Hu, XiaoLu; Pan, Quan-ke; Miao, Zhonghua; J. Fu , J. Sun
The distributed permutation flowshop scheduling problem with preventive maintenance operator (PM/DPFSP) is closely related to modem industry. This paper presents an improved discrete artificial bee colony (IDABC) algorithm for solving this problem. The criterion to be optimized is the makespan. An improved NEH heuristic method is proposed to initialize the population effectively. We adapted a local search method with insertion and swap operator to produce neighboring solutions in employ bee phase and onlooker bee phase. A global search method with destruction and reconstruction phase is introduced to avoid local optima in scout bee phase. The parameters for the proposed IDABC are calibrated by means of a design of experiments and analysis of variance. We conduct extensive experiments to test the performance of IDABC. Computational results indicate that IDABC has promising advantages on PM/DPFSP. © 2020 Elsevier B.V. All rights reserved.
Citation - WoS: 6
An iterated greedy algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime
(IEEE, 2020) Jiayang Mao; XiaoLu Hu; Quan-ke Pan; Zhonghua Miao; Chuangxin He; M. Fatih Tasgetiren; Tasgetiren, M. Fatih; He, Chuangxin; Mao, Jiayang; Hu, XiaoLu; Pan, Quan-ke; Miao, Zhonghua; J Fu; J Sun
In recent years the distributed permutation flowshop scheduling problem (DPFSP) has been widely studied. In this paper we extended the DPFSP by considering preventive maintenance (PM) operation to prevent machines from breaking down after the long process. An iterated greedy (IG) algorithm is developed to minimize total flowtime. A heuristic with swapping operator is proposed to initialize the IG. After that the destruction phase and construction phase are modified to fit our problem. A local search is then applied to further improve the solution generated in the construction stage. At last a simple simulated annealing-like acceptance criterion is used to prevent local optimal situations. Comparison with three state-of-the art algorithms in the recent literature based on 225 instances shows the high performance of our IG algorithm for solving the DPFSP with PM operation.
Citation - WoS: 16
Citation - Scopus: 19
An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion
(IEEE, 2014) Damla Kizilay; M. Fatih Tasgetiren; Quan-Ke Pan; Ling Wang; Kizilay, Damla; Tasgetiren, M. Fatih; Pan, Quan-Ke; Hu, XiaoLu; Wang, Ling; Chen, Shuai
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. We developed the constructive heuristics based the profile fitting heuristic by exploiting the waiting time feature of the HFS problem. In addition we also developed an IG algorithm with a simple insertion based local search for the first time in the literature too. The benchmark suite developed for the HFS problem are used to test the performance of the constructive heuristics and the IG algorithm. The computational results show that constructive heuristics developed were able to further improve the traditional NEH heuristics for the HFS problem with makespan criterion. Furthermore with a very short CPU times of 50nm miliseconds the performance of the IG algorithm was very competitive to the PSO and AIS algorithms that were run for 1600 seconds.
Citation - WoS: 2
Citation - Scopus: 3
An iterated local search algorithm for distributed assembly permutation flowshop problem
(IEEE, 2020) Ying-Ying Huang; Quan-ke Pan; XiaoLu Hu; Mehmet Fatih Tasgetiren; Jiang-ping Huang; Tasgetiren, M. Fatih; Huang, Ying-Ying; Pan, Quan-ke; Hu, XiaoLu; Huang, Jiang-ping; J Fu; J Sun
Nowadays the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper we propose a group iterated local search (gILS) algorithm to solve the problem with total flowtime (TF) criterion. We use the heuristic method based on a ascending order which is originated from the NEH. In order to simplify and optimize the algorithm we introduce two kinds of local search methods based on products and jobs respectively. In addition considering the diversity of search area we propose a probabilistic random selection based on the TF value and the number of iterations to determine the optimized solution. Acceptance criterion is a simple comparison to determine whether a new solution is acceptable or not. Finally we calculate 180 instances with our proposed algorithm and compare the results with those from the recent effective algorithms. The results verify the superiority of the presented gILS algorithm.
Citation - WoS: 3
Citation - Scopus: 2
NEH-Based heuristics for the distributed blocking flowshop with makespan criterion
(IEEE Computer Society help@computer.org, 2020) Shuai Chen; Quanke Pan; Xiaolu Hu; M. Fatih Tasgetiren; Tasgetiren, M Fatih; Pan, Quan-Ke; Hu, XiaoLu; Chen, Shuai; J. Fu , J. Sun
The distributed blocking flowshop scheduling problem (DBFSP) that is an important generalization of the traditional blocking flowshop scheduling problem (BFSP) in which the blocking constraint has to be considered. The NEH heuristic is regarded as the best constructive heuristic for the permutation flowshop scheduling problem. Naderi and Ruiz proposed the NEH2 for the distributed permutation flowshop scheduling problem by adding a factory assignment rule to the Nawaz-Enscore-Ham (NEH) heuristic. In this paper a priority rule is first presented for generating initial sequence for the NEH2. Then the proposed rescheduling operator is applied in NEH insertion procedure. Additionally we generated a sequence containing all job twice and then the solution for the problem is constructed by applying the NEH insertion procedure on each element of the sequence. Based on the above ideas we proposed three NEH-based heuristics namely NEH2E NEH2Een and NEH2EE. Computational results demonstrate that the proposed heuristics perform significantly better than the original NEH2. © 2020 Elsevier B.V. All rights reserved.