Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance

DOI10.1016/j.apm.2005.03.017zbMath1163.90511MaRDI QIDQ2504408

A. Sadegheih

Publication date: 25 September 2006

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2005.03.017

zbMATH Keywords

dynamic programming; simulated annealing; genetic algorithms; job shop scheduling; heuristic algorithms; flow shop scheduling; branch and bound programming

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Sequence optimization and design of allocation using GA and SA, New filled functions for nonsmooth global optimization, An improved particle swarm optimization algorithm for flowshop scheduling problem, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms, A stone resource assignment model under the fuzzy environment

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• An Improved Simulated Annealing Algorithm with Genetic Characteristics and the Traveling Salesman Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem