Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Gao, Kaizhou"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Intelligent Optimization Under the Makespan Constraint: Rapid Evaluation Mechanisms Based on the Critical Machine for the Distributed Flowshop Group Scheduling Problem
    (2023) Wang, Yuhang; Han, Yuyan; Wang, Yuting; Tasgetiren, M. Fatih; Li, Junqing; Gao, Kaizhou
    In the flowshop scheduling literature, the insertion-based neighborhood search method is often considered to obtain high-quality solutions. It will lead to expending extensive computational effort when evaluating the objective function. Rapid evaluation methods based on Taillard's acceleration can reduce the time complexity of function evaluation. However, existing rapid evaluation methods cannot be applied directly to the distributed flowshop group scheduling problem (DFGSP), especially to minimize the total tardiness time objective. Thus, we first proposed two theorems and their proofs based on the critical machine. Then, two rapid evaluation methods based on these theorems are proposed to accelerate the evaluation of the objective. Considering the multiple coupled sub-problems in the DFGSP, we proposed a cooperative iterated greedy algorithm (CIG) combining two rapid evaluation methods, in which intergroup and intra-group neighborhood search strategies are proposed to enhance the search depth and breadth. Comprehensive statistical experiments show that computational effort is extensively decreased in the calculation of total tardiness time, and the CIG algorithm significantly outperforms the eight compared algorithms.& COPY; 2023 Elsevier B.V. All rights reserved.

| Başkent Üniversitesi | Kütüphane | Açık Bilim Politikası | Açık Erişim Politikası | Rehber |

DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify