Browsing by Author "Chen, Shuai"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Conference Object
    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.
  • Thumbnail Image
    Conference Object
    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.