2008•Machine Tool & HydraulicsRequires access

Applications of One Improved Genetic Algorithm in Solving the Job-Shop Scheduling

Xifan Yao

Abstract

Based on the mathematical model of job shop scheduling system,the genetic algorithm (GA) of solving job-shop scheduling problem,especially the method of generating feasible scheduling and GA improvement were discussed.The typical Job-Shop scheduling problem,FT06,was taken as example to verify the improved algorithm,and effective results were gotten.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Flow shop scheduling, Job shop scheduling, Rate-monotonic scheduling, Computer science, Fair-share scheduling, Dynamic priority scheduling, Mathematical optimization, Job shop