Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem

DOI10.1287/IJOC.6.2.161MaRDI QIDQ4302718zbMATH OpenOpenAlexFDO

Authors 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

assembly line balancinggenetic algorithms

Mathematics Subject Classification ID

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

Recommendations

• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Feature Article—Genetic Algorithms for the Operations Researcher
• Genetic local search in combinatorial optimization
• A genetic approach to the quadratic assignment problem
• A randomized heuristics for the mapping problem: The genetic approach

Cited in

(19)

• A genetic algorithm for the proportionate multiprocessor open shop
• A heuristic-based genetic algorithm for workload smoothing in assembly lines
• A line up evolutionary algorithm for solving nonlinear constrained optimization problems
• Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study
• A comparison of local search methods for flow shop scheduling
• Metaheuristics: A bibliography
• 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
• Core-periphery structure in networks: a statistical exposition
• scientific article; zbMATH DE number 5944647 (Why is no real title available?)
• scientific article; zbMATH DE number 5781313 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 5634948 (Why is no real title available?)
• Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index
• A divide-and-conquer algorithm for core-periphery identification in large networks
• An efficient hybridization of ant colony optimization and genetic algorithm for an assembly line balancing problem of type II under zoning constraints
• The optimal configuration for various placement machines in PCB assembly lines

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

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