Metaheuristics based on Bin Packing for the line balancing problem

DOI10.1051/ro:2007018zbMath1190.90087OpenAlexW2090842260MaRDI QIDQ3598684

Nathalie Grangeon, Sylvie Norre, Michel Gourgand

Publication date: 3 February 2009

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=RO_2007__41_2_193_0/

zbMATH Keywords

simulationstochasticflow-shopMarkovian analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

A survey of the parallel assembly lines balancing problem, A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines, The hybrid flow shop scheduling problem, A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

Cites Work

• Unnamed Item
• Assembly line balancing as generalized bin packing
• Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure
• The application of a tabu search metaheuristic to the assembly line balancing problem
• Balancing assembly lines effectively -- a computational comparison
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• Balancing assembly lines with tabu search
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations
• Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
• Stochastic assembly line balancing using simulated annealing
• Algorithm for tool placement in an automatic tool change magazine