A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem
Authors:
- Zhifeng LiuZLZhifeng Liu
- Junlong WangJWJunlong Wang
- Caixia ZhangCZCaixia Zhang
- Hongyan ChuHCHongyan Chu
- Guozhi DingGDGuozhi Ding
- Lu ZhangLZLu Zhang
- 1 November 2021
- journal article
- research article
- Published by Elsevier in Computers & Operations Research
- Vol. 135
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (51975019)
- Beijing University of Technology
- National Major Science and Technology Projects of China (2019ZX04024001)
This publication has 39 references indexed in Scilit:
- An effective genetic algorithm for the flexible job-shop scheduling problemExpert Systems with Applications, 2011
- An artificial immune algorithm for the flexible job-shop scheduling problemFuture Generation Computer Systems, 2010
- Flexible job-shop scheduling with parallel variable neighborhood search algorithmExpert Systems with Applications, 2010
- A genetic algorithm for the Flexible Job-shop Scheduling ProblemComputers & Operations Research, 2008
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problemsComputers & Operations Research, 2008
- Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problemsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2002
- Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences1998
- Solving the job shop scheduling problem with tabu searchIIE Transactions, 1995
- Applying tabu search to the job-shop scheduling problemAnnals of Operations Research, 1993
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993