TY - JOUR
T1 - Multi-Level Relevance Resources Coordinated Scheduling Based on Improved Genetic Algorithm
AU - Lu, Zhi Bing
AU - Wang, Ai Min
AU - Tang, Cheng Tong
N1 - Publisher Copyright:
© 2017, Editorial Department of Transaction of Beijing Institute of Technology. All right reserved.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - In the actual scheduling process of production, there are multi-level relevance resources to be scheduling, like operators, machines, fixtures and cutters participate in the job-shop operation. In this paper, a new scheduling method was proposed based on improved genetic algorithm (GA) for multi-level relevance resources coordinated scheduling to combine the constraints among operators, fixtures and cutters, to be different from traditional production scheduling focusing only on machines. This method consisted mainly of two parts: an improved GA was used to match the multi-level relevance resources those meet the matching relationship, and the best combination of multi-level relevance resources through adapted calculation was saved; scheduling time calculation for multi-level relevance resources processes (MRRP) was established, and according to the processes occupancy of multi-level relevance resources, the earliest available time span was found for insert MRRP. Finally, the effectiveness of the method was demonstrated with the result analysis of practical examples.
AB - In the actual scheduling process of production, there are multi-level relevance resources to be scheduling, like operators, machines, fixtures and cutters participate in the job-shop operation. In this paper, a new scheduling method was proposed based on improved genetic algorithm (GA) for multi-level relevance resources coordinated scheduling to combine the constraints among operators, fixtures and cutters, to be different from traditional production scheduling focusing only on machines. This method consisted mainly of two parts: an improved GA was used to match the multi-level relevance resources those meet the matching relationship, and the best combination of multi-level relevance resources through adapted calculation was saved; scheduling time calculation for multi-level relevance resources processes (MRRP) was established, and according to the processes occupancy of multi-level relevance resources, the earliest available time span was found for insert MRRP. Finally, the effectiveness of the method was demonstrated with the result analysis of practical examples.
KW - Coordinated scheduling constraint
KW - Dynamic resources combination
KW - Genetic algorithm
KW - Job-shop scheduling
KW - Multi-level relevance resources
UR - https://www.scopus.com/pages/publications/85031098924
U2 - 10.15918/j.tbit1001-0645.2017.07.010
DO - 10.15918/j.tbit1001-0645.2017.07.010
M3 - Article
AN - SCOPUS:85031098924
SN - 1001-0645
VL - 37
SP - 711
EP - 716
JO - Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
JF - Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology
IS - 7
ER -