A genetic algorithm applied to a classic job-shop scheduling problem

DOI10.1080/00207729708929359zbMath0872.90050OpenAlexW2151445405MaRDI QIDQ3124682

Guoyong Shi

Publication date: 13 March 1997

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207729708929359

zbMATH Keywords

genetic algorithmjob-shop scheduling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Related Items

A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan, A local and global search combine particle swarm optimization algorithm for job-shop scheduling to minimize makespan, Modelling adaptive multi-agent manufacturing control with discrete event system formalism, Improved immune algorithm for global numerical optimization and job-shop scheduling problems, Hybrid multi-objective optimisation for concurrent activities consolidating two docked spacecraft, Genetic algorithms and simulated annealing for scheduling in agile manufacturing, Deterministic job-shop scheduling: Past, present and future, A hybrid genetic algorithm for the open shop scheduling problem

Cites Work

• Unnamed Item
• An Algorithm for Solving the Job-Shop Problem