Scheduling for the Flexible Job-Shop Problem Based on Genetic Algorithm (GA)

Shun Cheng Fan; Jin Feng Wang

doi:10.4028/www.scientific.net/AMR.457-458.616

Paper Titles

A Color Correlation and Texture-Based Shadow Elimination Method for Rainy Highway Videos
p.593

An Improved MMSE Pre-Coding Method for the Downlink Multi-User MIMO System
p.600

Numerical Simulation on the Combustion Characteristics of Armored Vehicle Diesel in Plateau Area
p.607

Microstructure and Formation Mechanism of Titanium Carbide Reinforced Ferrous Composite
p.611

Scheduling for the Flexible Job-Shop Problem Based on Genetic Algorithm (GA)
p.616

A Novel Method to Recognise Closely Connected CAPTCHA
p.620

An Approach to Assembly Sequence Planning Using Simulated Annealing
p.628

Apply Language Nature Rhythm to Large Scale Duplicated Text Detection
p.635

The Foundation of Campus Card System Platform Construction and Application Function Analysis
p.641

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 457-458Scheduling for the Flexible Job-Shop Problem Based...

Scheduling for the Flexible Job-Shop Problem Based on Genetic Algorithm (GA)

Abstract:

In this paper, we analyze the characteristics of the flexible job-shop scheduling problem(FJSP). A novel genetic algorithm is elaborated to solve the FJSP. An improved chromosome representation is used to conveniently represent a solution of the FJSP. Initial population is generated randomly. The relevant selection, crossover and mutation operation is also designed. It jumped from the local optimal solution, and the search area of solution is improved. Finally, the algorithm is tested on instances of 4 jobs and 6 machines. Computational results prove the proposed genetic algorithm effective for solving the FJSP.