An adaptive genetic algorithm for solving a class of combinatorial scheduling problems

zbMATH Open1105.90108MaRDI QIDQ5485151FDOQ5485151

Jihong Zhang, Liangwei Cai

Publication date: 29 August 2006

Recommendations

• scientific article; zbMATH DE number 1174531
• A genetic algorithm applied to a classic job-shop scheduling problem
• The Research of Solution to the Problems of Complex Task Scheduling Based on Self-adaptive Genetic Algorithm
• Genetic algorithms used to solve scheduling problems
• A new coevolutionary genetic algorithm for job-shop scheduling problems

zbMATH Keywords

optimizationJob Shop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (12)

• Evolutionary Computation in Combinatorial Optimization
• Genetic algorithms used to solve scheduling problems
• The useful deformities in genetic algorithms.
• Title not available (Why is that?)
• Diversity controlling genetic algorithm for order acceptance and scheduling problem
• Title not available (Why is that?)
• Adaptive search and the management of logistics systems. Base models for learning agents
• Improvement genetic algorithm for machine scheduling problem squares estimator is BLUE
• A new coevolutionary genetic algorithm for job-shop scheduling problems
• An approach to JSP by improved genetic algorithm
• The Research of Solution to the Problems of Complex Task Scheduling Based on Self-adaptive Genetic Algorithm
• Un algoritmo genético para un problema de horarios con restricciones especiales

This page was built for publication: An adaptive genetic algorithm for solving a class of combinatorial scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485151)