Balancing and Sequencing of Assembly LinesThe book deals 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 present 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 showing the effectiveness of the new methods and their superiority over existing approaches are reported. |
Contents
Problems | 1 |
SingleModel Assembly Lines | 23 |
MixedModel Assembly Lines | 77 |
Copyright | |
8 other sections not shown
Other editions - View all
Common terms and phrases
algorithm assembly line balancing assigned to station backward balance delay basic Baybars bidirectional bin packing problem bound LB bound procedure branch and bound buffer combination complexity computation considered contains costs 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 latest stations line balancing problems line efficiency local lower bound lower bound LC Lower Bound Method maximum load rule Minimize mixed-model modified MSP-W NP-complete NP-hard number of stations objective function objective function value obtained operation optimal solution overload pattern performed precedence constraints precedence graph precedence relations priority rules problem instances respect restrictions root node S₂ SALBP SALBP-1 SALBP-F instances SALOME-1 search methods Section sequencing problem solved station loads station requirement stationoriented strategy subproblems subset sum problem Table tabu search procedure taskoriented tion trial cycle upper bound utility variables versions workpieces