An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time

DOI10.1016/j.ejor.2013.03.003zbMath1317.90325OpenAlexW2088190248MaRDI QIDQ2355812

Jordi Pereira, Mariona Vilà

Publication date: 28 July 2015

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

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

zbMATH Keywords

manufacturingbranch and boundassembly line balancing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items

Heuristics and lower bounds for the simple assembly line balancing problem type 1: overview, computational tests and improvements, Assembly line balancing: what happened in the last fifteen years?, Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2), Procedures for the bin packing problem with precedence constraints, Branch, bound and remember algorithm for two-sided assembly line balancing problem, Enhanced branch-bound-remember and iterative beam search algorithms for type II assembly line balancing problem, Analysis of the simple assembly line balancing problem complexity, Developing optimization \& robust models for a mixed-model assembly line balancing problem with semi-automated operations, Exact and heuristic methods for solving the robotic assembly line balancing problem, A branch-and-bound algorithm for assembly line worker assignment and balancing problems

Cites Work

• Unnamed Item
• Ant algorithms for a time and space constrained assembly line balancing problem
• A dynamic programming based heuristic for the assembly line balancing problem
• Branch-and-bound algorithms for the multi-product assembly line balancing problem
• An enumerative heuristic and reduction methods for the assembly line balancing problem
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• Beam-ACO for Simple Assembly Line Balancing
• Eureka: A Hybrid System for Assembly Line Balancing
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing
• Assembly-Line Balancing—Dynamic Programming with Precedence Constraints