Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure

Assembly line balancing problems (ALBP) arise whenever an assembly line is configured, redesigned or adjusted. An ALBP consists of distributing the total workload for manufacturing any unit of the products to be assembled among the work stations along the line subject to a strict or average cycle time. Traditionally, stations are considered to be manned by one operator, respectively, or duplicated in form of identical parallel stations, each also manned by a single operator. In practice, this assumption is usually too restrictive. This is particularly true for large products like cars, trucks, busses and machines, which can be handled by several operators performing different tasks at the same time. Only restricted research has been done on such parallel workplaces within the same station though they have significant relevance in real-world assembly line settings. In this paper, we consider an extension of the basic ALBP to the case of flexible parallel workplaces (VWALBP) as they typically occur in the automobile and other industries assembling large products. The problem is defined and modelled as an integer linear program. As a solution approach a branch-and-bound procedure is proposed which also can be applied as a heuristic. Finally, computational experiments documenting the solution capabilities of the procedure are reported.

[1]  Krzysztof Fleszar,et al.  An enumerative heuristic and reduction methods for the assembly line balancing problem , 2003, Eur. J. Oper. Res..

[2]  Angel B. Ruiz,et al.  Balancing assembly lines with tabu search , 2006, Eur. J. Oper. Res..

[3]  Armin Scholl,et al.  Incorporating ergonomic risks into assembly line balancing , 2011, Eur. J. Oper. Res..

[4]  Roman Słowiński,et al.  Advances in project scheduling , 1989 .

[5]  J. J. Bartholdi,et al.  Balancing two-sided assembly lines: a case study , 1993 .

[6]  Maurice Kilbridge,et al.  A REVIEW OF ANALYTICAL SYSTEMS OF LINE BALANCING , 1962 .

[7]  Roger V. Johnson,et al.  Optimally balancing large assembly lines with `FABLE' , 1988 .

[8]  Robert Klein,et al.  Scheduling of Resource-Constrained Projects , 1999 .

[9]  Ilker Baybars,et al.  A survey of exact algorithms for the simple assembly line balancing , 1986 .

[10]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[11]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[12]  J. H. Patterson,et al.  An Algorithm for a general class of precedence and resource constrained scheduling problems , 1989 .

[13]  Ram Rachamadugu,et al.  Assembly line design with incompatible task assignments , 1991 .

[14]  Angel B. Ruiz,et al.  Balancing assembly lines: an industrial case study , 2004, J. Oper. Res. Soc..

[15]  Rainer Kolisch,et al.  Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes , 1995 .

[16]  Robert R. Inman,et al.  SCHEDULING DUPLICATE SERIAL STATIONS IN TRANSFER LINES , 1994 .

[17]  Armin Scholl,et al.  A survey on problems and methods in generalized assembly line balancing , 2006, Eur. J. Oper. Res..

[18]  Yeongho Kim,et al.  Two-sided assembly line balancing to maximize work relatedness and slackness , 2001 .

[19]  Michael J. Magazine,et al.  Assembly line balancing as generalized bin packing , 1982, Oper. Res. Lett..

[20]  Bhaba R. Sarker,et al.  A generalized approach for serial or parallel line balancing , 1983 .

[21]  Nils Boysen,et al.  A classification of assembly line balancing problems , 2007, Eur. J. Oper. Res..

[22]  Fred M. Tonge,et al.  Summary of a Heuristic Line Balancing Procedure , 1960 .

[23]  Roger V. Johnson,et al.  A Branch and Bound Algorithm for Assembly Line Balancing Problems with Formulation Irregularities , 1983 .

[24]  Armin Scholl,et al.  Balancing and Sequencing of Assembly Lines , 1995 .

[25]  Hartmut Stadtler,et al.  Supply Chain Management and Advanced Planning , 2000 .

[26]  Armin Scholl,et al.  SALOME: A Bidirectional Branch-and-Bound Procedure for Assembly Line Balancing , 1997, INFORMS J. Comput..

[27]  Hirokazu Osaki,et al.  A method for assembly line balancing with more than one worker in each station , 1983 .

[28]  Basheer M. Khumawala,et al.  A branch and bound algorithm for assembly line balancing with paralleling , 1975 .

[29]  G. M. Buxey,et al.  Assembly Line Balancing with Multiple Stations , 1974 .

[30]  Alessandro Agnetis,et al.  Balancing flexible lines for car components assembly , 1995 .

[31]  Türkay Dereli,et al.  Two-sided assembly line balancing using an ant-colony-based heuristic , 2008 .

[32]  Jonathan F. Bard,et al.  Assembly line balancing with parallel workstations and dead time , 1989 .

[33]  Nils Boysen,et al.  Absalom: Balancing assembly lines with assignment restrictions , 2010, Eur. J. Oper. Res..

[34]  Armin Scholl,et al.  State-of-the-art exact and heuristic solution procedures for simple assembly line balancing , 2006, Eur. J. Oper. Res..

[35]  Sándor P. Fekete,et al.  New classes of fast lower bounds for bin packing problems , 2001, Math. Program..

[36]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[37]  Enn Tyugu,et al.  Constraint Programming , 1994, NATO ASI Series.

[38]  Armin Scholl,et al.  Balancing assembly lines effectively - A computational comparison , 1999, Eur. J. Oper. Res..

[39]  Armin Scholl,et al.  Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem , 1997, Comput. Oper. Res..

[40]  Yeongho Kim,et al.  Two-sided assembly line balancing: A genetic algorithm approach , 2000 .

[41]  Francis J. Nourie,et al.  Finding optimal line balances with OptPack , 1991, Oper. Res. Lett..

[42]  A. L. Arcus,et al.  COMSOAL: a computer method of sequencing operations for assembly lines , 1965 .

[43]  Peter A. Pinto,et al.  Branch and bound and heuristic procedures for assembly line balancing with paralleling of stations , 1981 .

[44]  Emanuel Falkenauer,et al.  Line Balancing in the Real World , 2005 .

[45]  James R. Jackson,et al.  A Computing Procedure for a Line Balancing Problem , 1956 .