A heuristic network procedure for the assembly line balancing problem

DOI10.1002/nav.3800250210zbMath0402.90048OpenAlexW2162177341MaRDI QIDQ4187563

David G. Dannenbring, Peter A. Pinto, Basheer M. Khumawala

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250210

zbMATH Keywords

SchedulingSensitivity AnalysisComputational EfficiencyHeuristic AlgorithmNetwork ProgrammingComputational ExperienceAssembly Line Balancing ProblemShortest Route Algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10) Deterministic scheduling theory in operations research (90B35) Applications of graph theory to circuits and networks (94C15)

Related Items

An efficient heuristic method for the simple assembly line balancing problem, State-of-the-art exact and heuristic solution procedures for simple assembly line balancing