Metaheuristics based on Bin Packing for the line balancing problem
From MaRDI portal
Publication:3598684
DOI10.1051/RO:2007018zbMATH Open1190.90087OpenAlexW2090842260MaRDI QIDQ3598684FDOQ3598684
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/
Recommendations
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- scientific article; zbMATH DE number 2050771
- The application of a tabu search metaheuristic to the assembly line balancing problem
- An efficient heuristic method for the simple assembly line balancing problem
- Comprehensive review and evaluation of heuristics and meta-heuristics for two-sided assembly line balancing problem
- A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time
- A dynamic programming based heuristic for the assembly line balancing problem
- A set-covering-based heuristic approach for bin-packing problems
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
- Algorithm for tool placement in an automatic tool change magazine
- 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
- Balancing assembly lines with tabu search
- Using simulated annealing to solve a multiobjective assembly line balancing problem with parallel workstations
- An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
- Stochastic assembly line balancing using simulated annealing
- Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- The hybrid flow shop scheduling problem
- A survey of the parallel assembly lines balancing problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A multiobjective optimization algorithm to solve the part feeding problem in mixed-model assembly lines
This page was built for publication: Metaheuristics based on Bin Packing for the line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3598684)
