This paper describes a branch and bound algorithm which can solve assembly line balancing probems with nine modifications to the originally formulated problem of minimizing the required number of assembly stations, given a cycle time, a set of tasks with given deterministic performance times,...

No abstract available.

Some of the legitimacy of Hoffmann's (1992) Eureka is gained from his statement that "Eureka ... would seem to be approximately six times as fast (as Johnson's (1988) FABLE on the literature set). However, Eureka had one problem for which its solution was one station over the optimal, whereas...

A new algorithm for optimally balancing assembly lines is formulated and tested. Named "FABLE," it obtains proven optimal solutions for ten 1000 task lines, which each possess the computationally favorable conditions of an average of at least 6 tasks per work station and a small number of...

A descriptive problem definition and a tested computerized heuristic solution procedure are offered for the problem of relative location of facilities in (or layout of) a multi-floor building. The problem definition and solution procedure overcome the problem of severe nonlinearity of...