An optimal procedure for the single-model deterministic assembly line balancing problem
DOI10.1016/0377-2217(79)90100-0zbMATH Open0392.90035OpenAlexW2002668050MaRDI QIDQ1251981FDOQ1251981
Authors: F. Van Assche, Willy Herroelen 
Publication date: 1979
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(79)90100-0
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Cites Work
- Summary of a heuristic line balancing procedure
- Technical Note—Assembly-Line Balancing: Zero-One Programming with Fibonacci Search
- Title not available (Why is that?)
- Assembly-Line Balancing—Dynamic Programming with Precedence Constraints
- An optimal procedure for the single-model deterministic assembly line balancing problem
Cited In (7)
- An linear programming based lower bound for the simple assembly line balancing problem
- A heuristic multi-start decomposition approach for optimal design of serial machining lines
- An optimal procedure for the single-model deterministic assembly line balancing problem
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Balancing assembly lines effectively -- a computational comparison
- Heuristics and their design: A survey
- Designing paced assembly lines with fixed number of stations
This page was built for publication: An optimal procedure for the single-model deterministic assembly line balancing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251981)
