Sequence optimization and design of allocation using GA and SA

DOI10.1016/j.amc.2006.08.078zbMath1128.90023OpenAlexW2056064075MaRDI QIDQ884646

A. Sadegheih

Publication date: 6 June 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.08.078

zbMATH Keywords

dynamic programmingmanufacturing systemssimulated annealinggenetic algorithmsheuristic algorithmsevolutionary algorithmflow shop schedulingbranch and bound programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items

Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm

Cites Work

• Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item