The Study of Job Shop Scheduling Based on Genetic Algorithm
Jun Xing Xiong, Jin Ping Zhao, Hai Ning Tu
Abstract
Jun Xing Xiong, Jin Ping Zhao, Hai Ning Tu
Abstract
Aiming at Job Shop Scheduling Problem with Minimal Makespan, This paper is designed to use genetic algorithm to solve the problem of job shop scheduling, and also achieves the algorithm by using the C#. Application shows that the genetic algorithm to solve job shop scheduling problem is efficient and has good application value.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aiming at Job Shop Scheduling Problem with Minimal Makespan, This paper is designed to use genetic algorithm to solve the problem of job shop scheduling, and also achieves the algorithm by using the C#. Application shows that the genetic algorithm to solve job shop scheduling problem is efficient and has good application value.
Key concepts: Job shop scheduling, Flow shop scheduling, Rate-monotonic scheduling, Computer science, Dynamic priority scheduling, Fair-share scheduling, Mathematical optimization, Job shop