A two-process implicit enumeration algorithm for the simple assembly line balancing problem

DOI10.1016/0377-2217(87)90276-1zbMath0622.90043OpenAlexW1989609000MaRDI QIDQ1091255

Ilker Baybars, Matthew J. Saltzman

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90276-1

zbMATH Keywords

networksassembly line balancingbranch-and-bound treesimplicit-enumeration algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Improved methods of assembly sequence determination for automatic assembly systems, Optimally solving the alternative subgraphs assembly line balancing problem, An improved mathematical program to solve the simple assembly line balancing problem, The sequence-dependent assembly line balancing problem, Balancing assembly lines effectively -- a computational comparison, A multiple-tree search procedure for the resource-constrained project scheduling problem, Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure, Designing paced assembly lines with fixed number of stations, \texttt{Absalom}: balancing assembly lines with assignment restrictions, 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

Cites Work

• 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
• An efficient heuristic method for the simple assembly line balancing problem
• A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem
• Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search