Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem

DOI10.1287/ijoc.6.2.161zbMath0805.90056OpenAlexW2126583902MaRDI QIDQ4302718

Michael C. Ferris, Edward J. Anderson

Publication date: 4 October 1994

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.6.2.161

zbMATH Keywords

genetic algorithmsassembly line balancing

Mathematics Subject Classification ID

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

Related Items (12)

A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ Core-periphery structure in networks: a statistical exposition ⋮ A line up evolutionary algorithm for solving nonlinear constrained optimization problems ⋮ Metaheuristics based on Bin Packing for the line balancing problem ⋮ Evaluation of performance measures for representing operational objectives of a mixed model assembly line balancing problem ⋮ A genetic algorithm for the proportionate multiprocessor open shop ⋮ A heuristic-based genetic algorithm for workload smoothing in assembly lines ⋮ Simulated annealing and genetic algorithms for scheduling products with multi-level product structure ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Balancing assembly lines with tabu search ⋮ Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study

This page was built for publication: Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem