Hybrid assembly line design and user's preferences

DOI10.1080/00207540110116264zbMath1064.90534OpenAlexW1994937597MaRDI QIDQ4807185

Alain Delchambre, Pierre de Lit, Brahim Rekiek

Publication date: 23 September 2003

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540110116264

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Production models (90B30)

Related Items

Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload ⋮ A classification of assembly line balancing problems ⋮ PROMETHEE: a comprehensive literature review on methodologies and applications ⋮ A versatile algorithm for assembly line balancing ⋮ New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions ⋮ Branch and bound procedures for solving the assembly line worker assignment and balancing problem: Application to sheltered work centres for disabled ⋮ On solving the assembly line worker assignment and balancing problem via beam search ⋮ A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem ⋮ Hybrid evolutionary multi-objective algorithms for integrating assembly sequence planning and assembly line balancing ⋮ Bi criteria flexible assembly line design problem with equipment decisions ⋮ \texttt{Absalom}: balancing assembly lines with assignment restrictions ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ A survey on problems and methods in generalized assembly line balancing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Genetic local search for multi-objective combinatorial optimization