Heuristic genetic algorithm for job shop scheduling problem

zbMATH Open1174.90524MaRDI QIDQ5453402FDOQ5453402

Lianghui Zhao, Feiqi Deng

Publication date: 4 April 2008

Recommendations

• A new hybrid genetic algorithm for job shop scheduling problem
• Solving flexible job shop scheduling problem by genetic algorithm
• A new hybrid parallel genetic algorithm for the job-shop scheduling problem
• A genetic algorithm applied to a classic job-shop scheduling problem
• scientific article; zbMATH DE number 2040690

zbMATH Keywords

hybrid genetic algorithmactive scheduleJob shop scheduling problembottleneck repair

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Stochastic scheduling theory in operations research (90B36)

Cited In (9)

• Title not available (Why is that?)
• An Improved Local Search Genetic Algorithm with Multi-crossover for Job Shop Scheduling Problem
• A Novel Heuristic Approach for Job Shop Scheduling Problem
• A Simple Optimised Search Heuristic for the Job Shop Scheduling Problem
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• Local search genetic algorithms for the job shop scheduling problem
• Genetic Simulated-Annealing Algorithm for Robust Job Shop Scheduling
• Evolutionary Computation in Combinatorial Optimization
• A genetic algorithm applied to a classic job-shop scheduling problem

This page was built for publication: Heuristic genetic algorithm for job shop scheduling problem

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