Balancing and sequencing of assembly lines
It 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.
Try this search over all volumes: twistmatrix
Results 1-0 of 0
What people are saying - Write a review
We haven't found any reviews in the usual places.
SingleModel Assembly Lines
Partn Solution Methods
MixedModel Assembly Lines
5 other sections not shown
algorithms applied assembly line balancing assigned to station av.cpu av.rel backward balance delay basic bidirectional Binary Search BiSL bound LB bound procedure branch and bound combination computation considered contains costs cycle time violations data set decision problems defined described dominance rule Domschke earliest and latest enumeration tree EUREKA example FABLE fathomed feasible solution Figure formulation Furthermore given idle improvement initial interval latest stations line balancing problems line efficiency Lower Bound Method MALBP maximal minimal modified MSP-W NP-hard number of stations objective function value obtained operation optimal solutions overload packing problem pattern performed precedence constraints precedence graph priority rules problem instances reduced respect restrictions SALBP SALBP-1 SALBP-F instances SALOME-1 Scholl search methods Section sequencing problem single-model solved station loads stationoriented strategy subproblems subset subset sum problem Table tabu list tabu search procedure taskoriented tion trial cycle unit of model upper bound utility variables versions workpieces