Tehnicki vjesnik - Technical Gazette · 2017 · 18 citations · 8 references
ManagementIndustrial EngineeringOperations ManagementOptimizationProduction PlanningSchedulingCombinatorial OptimizationEvolutionary ComputationGenetic AlgorithmsJob SchedulingJob Shop SchedulingMachine SchedulingGenetic Algorithm OptimizationGenetic Algorithm Variable SelectionHeuristic Algorithms
The Job Shop Scheduling Problem (JSSP) is one of the most general and difficult of all traditional scheduling combinatorial problems with considerable importance in industry. When solving complex problems, search based on traditional genetic algorithms has a major drawback - high requirement for computational power. The goal of this research was to develop fast and efficient scheduling method based on genetic algorithm for solving the job-shop scheduling problems. In proposed GA initial population is generated randomly, and the relevant crossover and mutation operation is also designed. This paper presents an efficient genetic algorithm for solving job-shop scheduling problems. Performance of the algorithm is demonstrated in the real-world examples.
8
Genetic algorithms in search, optimization, and machine learning
Choice Reviews Online · 1989 · 49.3K citations
John H. Holland · Scientific American · 1992 · 5.3K citations