Branch-and-bound algorithms for the multi-product assembly line balancing problem

DOI10.1016/0377-2217(92)90208-QzbMath0757.90029OpenAlexW2090324882MaRDI QIDQ1194733

Jean-Marie Bourjolly, Gilbert Laporte, Ilana Berger

Publication date: 6 October 1992

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90208-q

zbMATH Keywords

branch-and-boundbin packingassembly line balancingtree searchflexible manufacturing systemsequential nonpreemptive tasks

Mathematics Subject Classification ID

Production models (90B30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A classification of assembly line balancing problems, An analysis of lower bound procedures for the bin packing problem, A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Bi-criteria assembly line balancing by considering flexible operation times, Modeling and Solving the Capacitated Vehicle Routing Problem on Trees, A proposed approach for reconfiguration of flexible assembly line systems by motion genes, Approximation algorithms for the load-balanced capacitated vehicle routing problem, The mixed and multi model line balancing problem: A comparison, \texttt{Absalom}: balancing assembly lines with assignment restrictions, Models for concurrent product and process design, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing, An linear programming based lower bound for the simple assembly line balancing problem, An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds and reduction procedures for the bin packing problem
• Assembly line balancing as generalized bin packing
• Fast, Effective Algorithms for Simple Assembly Line Balancing Problems
• 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
• Capacitated Vehicle Routing on Trees
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs