Local search genetic algorithms for the job shop scheduling problem
From MaRDI portal
Publication:702800
DOI10.1023/B:APIN.0000027769.48098.91zbMath1078.68597OpenAlexW2017773796MaRDI QIDQ702800
Beatrice M. Ombuki, Mario Ventresca
Publication date: 19 January 2005
Published in: Applied Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:apin.0000027769.48098.91
Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
Ant colony optimisation with parameterised search space for the job shop scheduling problem ⋮ An object-coding genetic algorithm for integrated process planning and scheduling ⋮ A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling ⋮ An agent-based parallel approach for the job shop scheduling problem with genetic algorithms ⋮ Improved hybrid simulated annealing algorithm for navigation scheduling for the two dams of the Three Gorges Project ⋮ A new hybrid genetic algorithm for job shop scheduling problem ⋮ Scheduling job shop problems with sequence-dependent setup times
Uses Software
This page was built for publication: Local search genetic algorithms for the job shop scheduling problem
