Balancing and Sequencing of Assembly LinesIt is dealt with two main decision problems which arise when flow-line production systems are installed and operated. The assembly line balancing problem consists of partitioning the work, necessary to assemble the product(s), among different stations of an assembly line. If several models of a product are jointly processed on a line, this medium-term problem is connected with the short-term problem of determining an operating sequence of the models. In Part I balancing and sequencing problems are discussed, classified, and arranged within a hierarchical planning system. In the second edition special emphasis is given to u-shaped assembly lines which are important components of modern just-in-time production systems. Part II is concerned with exact and heuristic procedures for solving those decision problems. For each problem type considered, a survey of existing procedures is given and new efficient solution methods are developed. Comprehensive numerical investigations are reported. |
Contents
Problems | 1 |
Heuristic Procedures for Single Model Assembly Line Balancing | 5 |
1 | 32 |
Copyright | |
8 other sections not shown
Common terms and phrases
algorithm assembly line balancing assigned to station backward balance delay Baybars bidirectional bin packing problem bound LB bound procedure branch and bound buffer combination complexity computation considered contains costs cycle time violations data set decision problem defined dominance rule Domschke earliest and latest enumeration tree EUREKA example FABLE fathomed feasible solution Figure formulation Furthermore heuristic idle initial interval iterations latest stations line balancing problems line efficiency local lower bound Lower Bound Method maximal Minimize mixed-model MSP-W NP-complete NP-hard number of stations objective function obtained operation optimal solution overload pattern performed precedence constraints precedence graph precedence relations problem instances production rate respect restrictions S₁ S₂ SALBP SALBP-1 SALBP-F instance SALOME-1 Section sequencing problem single-model solved station loads station requirement stationoriented strategy subproblems subset subset sum problem Table tabu search procedure tion trial cycle unit of model upper bound utility variables versions workpieces