A Batch Scheduling Technique of Flexible Job-Shop Based on Improved Genetic Algorithm

Yueshu Li, Aimin Wang, Shengwei Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

In order to solve the flexible job-shop batch scheduling problem, based on the heuristic scheduling method, this paper design a flexible job shop batch scheduling algorithm, by using the framework of genetic algorithm and a flexible batch coding method based on 'cursors'. While finding the optimal batch strategy through genetic algorithm, the algorithm uses heuristic method to solve the sub-problem of sub-lot scheduling, taking into account the completeness and rapidity of solution. Finally, through simulation experiments, the results are analyzed to verify the effectiveness of the algorithm.

Original languageEnglish
Title of host publication2022 IEEE International Conference on Mechatronics and Automation, ICMA 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1463-1467
Number of pages5
ISBN (Electronic)9781665408523
DOIs
Publication statusPublished - 2022
Event19th IEEE International Conference on Mechatronics and Automation, ICMA 2022 - Guilin, Guangxi, China
Duration: 7 Aug 202210 Aug 2022

Publication series

Name2022 IEEE International Conference on Mechatronics and Automation, ICMA 2022

Conference

Conference19th IEEE International Conference on Mechatronics and Automation, ICMA 2022
Country/TerritoryChina
CityGuilin, Guangxi
Period7/08/2210/08/22

Keywords

  • batch scheduling
  • flexible job-shop
  • genetic algorithm
  • heuristic

Fingerprint

Dive into the research topics of 'A Batch Scheduling Technique of Flexible Job-Shop Based on Improved Genetic Algorithm'. Together they form a unique fingerprint.

Cite this