An Integer Programming Algorithm with Network Cuts for Solving the Assembly Line Balancing Problem

DOI10.1287/mnsc.30.1.85zbMath0554.90055OpenAlexW2011382117MaRDI QIDQ3217917

James H. Patterson, F. Brian Talbot

Publication date: 1984

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/36185

zbMATH Keywords

assembly line balancing problemcycle time restrictionsenumeration processnetwork cutprecedence restrictions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items

U-shaped assembly line layouts and their impact on labor productivity: an experimental study ⋮ An efficient heuristic method for the simple assembly line balancing problem ⋮ A two-process implicit enumeration algorithm for the simple assembly line balancing problem ⋮ Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing ⋮ A versatile algorithm for assembly line balancing ⋮ An interactive approach to bicriterion loading of a flexible assembly system ⋮ R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines ⋮ SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing ⋮ Branch-and-bound algorithms for the multi-product assembly line balancing problem ⋮ A strong cutting plane algorithm for the robotic assembly line balancing problem ⋮ Assembly line balancing and group working: a heuristic procedure for workers' groups operating on the same product and workstation ⋮ Metaheuristics based on Bin Packing for the line balancing problem ⋮ An improved mathematical program to solve the simple assembly line balancing problem ⋮ A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem ⋮ A multiple criteria decision making approach for the assembly line balancing problem ⋮ Balancing assembly lines effectively -- a computational comparison ⋮ Maximizing the production rate in simple assembly line balancing -- A branch and bound procedure ⋮ A lexicographic approach to bi-objective loading of a flexible assembly system ⋮ Balancing \(U\)-lines in a multiple \(U\)-line facility ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds ⋮ An optimal piecewise-linear program for the U-line balancing problem with stochastic task times ⋮ Balancing assembly lines with tabu search ⋮ Valid inequalities for a class of assembly system problems ⋮ A knowledge-based system for solving multi-objective assembly line balancing problems