Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds

DOI10.1016/j.ejor.2004.07.026zbMath1083.90012OpenAlexW2020283615MaRDI QIDQ2569064

Matthias Amen

Publication date: 17 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.07.026

zbMATH Keywords

manufacturingproductionmodel buildingassembly line balancingcombinatorial optimisationimplicit enumeration

Mathematics Subject Classification ID

Production models (90B30) Discrete location and assignment (90B80)

Related Items (11)

A classification of assembly line balancing problems ⋮ The type E simple assembly line balancing problem: a mixed integer linear programming formulation ⋮ A memetic algorithm for the cost-oriented robotic assembly line balancing problem ⋮ ASALBP: the alternative subgraphs assembly line balancing problem ⋮ Sequence-dependent time- and cost-oriented assembly line balancing problems: a combinatorial Benders’ decomposition approach ⋮ Research trends in combinatorial optimization ⋮ Bi-criteria assembly line balancing by considering flexible operation times ⋮ On the complexity of assembly line balancing problems ⋮ An improved mathematical program to solve the simple assembly line balancing problem ⋮ A multiple single-pass heuristic algorithm solving the stochastic assembly line rebalancing problem ⋮ Using distributed search methods for balancing mixed-model assembly lines in the automotive industry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Assembly line balancing as generalized bin packing
• An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem
• Assembly-Line Balancing by Linear Programming
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• A comparison of heuristic algorithms for cost-oriented assembly line balancing
• Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
• A strong cutting plane algorithm for the robotic assembly line balancing problem
• An Algorithm for the Line Balancing Problem
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• Surrogate Constraints
• An Improved Implicit Enumeration Approach for Integer Programming
• On Assembly-Line Balancing Problems
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Integer Programming by Implicit Enumeration and Balas’ Method
• An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey

This page was built for publication: Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds