A heuristic network procedure for the assembly line balancing problem

DOI10.1002/NAV.3800250210zbMATH Open0402.90048OpenAlexW2162177341MaRDI QIDQ4187563FDOQ4187563

Authors: Peter A. Pinto, David G. Dannenbring, 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

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

Cited In (2)

• 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

This page was built for publication: A heuristic network procedure for the assembly line balancing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187563)