An improved genetic algorithm for flexible job shop scheduling problem considering reconfigurable machine tools with limited auxiliary modules
Authors:
- Jiaxin FanJFJiaxin Fan
- Chunjiang ZhangCZChunjiang Zhang
- Qihao LiuQLQihao Liu
- Weiming ShenWSWeiming Shen
- Liang GaoLGLiang Gao
Top Cited Papers
- 9 February 2022
- journal article
- research article
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 62, 650-667
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (51905199, U20A6004)
- China National Funds for Distinguished Young Scientists (51825502)
This publication has 47 references indexed in Scilit:
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problemComputers & Operations Research, 2011
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjectiveComputers & Operations Research, 2011
- Design of reconfigurable manufacturing systemsJournal of Manufacturing Systems, 2010
- Mathematical models for job-shop scheduling problems with routing and process plan flexibilityApplied Mathematical Modelling, 2010
- Modeling semiconductor testing job scheduling and dynamic testing machine configurationExpert Systems with Applications, 2008
- Reconfigurable Manufacturing SystemsCIRP Annals, 1999
- A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shopsIIE Transactions, 1998
- Scheduling research in multiple resource constrained job shops: a review and critiqueInternational Journal of Production Research, 1996
- Routing and scheduling in a flexible job shop by tabu searchAnnals of Operations Research, 1993
- Genetic AlgorithmsScientific American, 1992