A cutting plane approach for the single-product assembly system design problem

This paper evaluates a new branch-and-cut approach, establishing a computational benchmark for the single-product, assembly system design (SPASD) problem. Our approach, which includes a heuristic, preprocessing, and two cutgenerating methods, outperformed OSL in solving a set of 102 instances of the SPASD problem. The approach is robust; test problems show that it can be applied to variations of the generic SPASD problem that we encountered in industry.

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

[2]  Richard M. Karp,et al.  Reducibility among combinatorial problems" in complexity of computer computations , 1972 .

[3]  Willy Herroelen,et al.  An optimal procedure for the single-model deterministic assembly line balancing problem , 1979 .

[4]  Stephen C. Graves,et al.  An Integer Programming Procedure for Assembly System Design Problems , 2011, Oper. Res..

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

[6]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

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

[8]  Stephen C. Graves,et al.  Equipment selection and task assignment for multiproduct assembly system design , 1988 .

[9]  Soumen Ghosh,et al.  A comprehensive literature review and analysis of the design, balancing and scheduling of assembly systems , 1989 .

[10]  Steven T. Hackman,et al.  Fast, Effective Algorithms for Simple Assembly Line Balancing Problems , 1989, Oper. Res..

[11]  Thomas R. Hoffman.  Eureka: a hybrid system for assembly line balancing , 1992 .

[12]  Sungsoo Park,et al.  A strong cutting plane algorithm for the robotic assembly line balancing problem , 1995 .

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

[14]  Willy Herroelen,et al.  Assembly line balancing by resource-constrained project scheduling techniques - A critical appraisal , 1996 .

[15]  W. Wilhelm,et al.  A family of hierarchical models for the design of deterministic assembly systems , 1997 .

[16]  Wilbert E. Wilhelm,et al.  A Branch and Cut Approach for Workload Smoothing on Assembly Lines , 1997, INFORMS J. Comput..

[17]  Ram Rachamadugu,et al.  Designing paced assembly lines with fixed number of stations , 1997 .

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

[19]  Alf Kimms,et al.  Minimal investment budgets for flow line configuration , 1998 .

[20]  W. Wilhelm,et al.  Assembly System Design: a Branch and Cut Approach , 1998 .

[21]  Wilbert E. Wilhelm,et al.  A Column-Generation Approach for the Assembly System Design Problem with Tool Changes , 1999 .

[22]  Gyana R. Parija,et al.  A Facet Generation Procedure for Solving 0/1 Integer Programs , 1999, Oper. Res..

[23]  A. Kimms.  Minimal investment budgets for flow line configuration , 2000 .