A General Variable Neighborhood Search for the NoIdle Flowshop Scheduling Problem with Makespan Criterion
Loading...

Date
2019
Authors
Liangshan Shen
M. Fatih Tasgetiren
Hande Oztop
Levent Kandiller
Liang Gao
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers Inc.
Open Access Color
Green Open Access
Yes
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
Abstract
This paper proposes a novel general variable neighborhood search (GVNS) algorithm to solve the no-idle flowshop scheduling problem with the makespan criterion. The initial solution of the GVNS is generated using the FRB5 heuristic. In the outer loop insert and swap operations are employed to shake the permutation. In the inner loop of variable neighborhood descent procedure two effective algorithms namely Iterated Greedy (IG) and Variable Block Insertion Heuristic (VBIH) algorithms are used. Note that an effective referenced insertion scheme is employed in these IG and VBIH algorithms. The proposed GVNS algorithm is compared with the standard IG algorithm using the benchmark instances. The computational experiments show that the GVNS performs much better than the standard IG. Furthermore the results of the standard IG and GVNS algorithms are compared with the current best-known solutions reported in the literature. The computational results show that the proposed GVNS algorithm improves some of the current best-known solutions in the literature. Consequently it can be said that the GVNS is very effective for the no-idle flowshop scheduling problem with the makespan criterion. © 2020 Elsevier B.V. All rights reserved.
Description
Keywords
General Variable Neighborhood Search, Iterated Greedy, Makespan, No-idle Flowshop Scheduling, Variable Block Insertion, Artificial Intelligence, Benchmarking, Optimization, Scheduling, Flow-shop Scheduling, Iterated Greedy, Makespan, Variable Block Insertion, Variable Neighborhood Search, Heuristic Algorithms, Artificial intelligence, Benchmarking, Optimization, Scheduling, Flow-shop scheduling, iterated greedy, Makespan, variable block insertion, Variable neighborhood search, Heuristic algorithms, Makespan, No-Idle Flowshop Scheduling, Iterated Greedy, Variable Block Insertion, General Variable Neighborhood Search
Fields of Science
0211 other engineering and technologies, 02 engineering and technology
Citation
WoS Q
Scopus Q

OpenCitations Citation Count
2
Source
2019 IEEE Symposium Series on Computational Intelligence SSCI 2019
Volume
Issue
Start Page
1684
End Page
1691
PlumX Metrics
Citations
CrossRef : 1
Scopus : 6
Captures
Mendeley Readers : 8
Google Scholar™


