Maximizing the production rate in simple assembly line balancing — A branch and bound procedure
Authors:
- Robert KleinRKRobert Klein
- Armin SchollASArmin Scholl
- 1 June 1996
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 91 (2) , 367-385
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Eureka: A Hybrid System for Assembly Line BalancingManagement Science, 1992
- Computing shortest paths in networks derived from recurrence relationsAnnals of Operations Research, 1991
- Fast, Effective Algorithms for Simple Assembly Line Balancing ProblemsOperations Research, 1989
- Optimally Balancing Large Assembly Lines with “Fable”Management Science, 1988
- A Survey of Exact Algorithms for the Simple Assembly Line Balancing ProblemManagement Science, 1986
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978
- A GENERAL METHOD FOR MACHINE SCHEDULINGInternational Journal of Production Research, 1968
- Assembly Line Balancing with a Precedence MatrixManagement Science, 1963
- Assembly-Line Balancing—Dynamic Programming with Precedence ConstraintsOperations Research, 1963
- A Computing Procedure for a Line Balancing ProblemManagement Science, 1956