Models for concurrent product and process design

We propose procedures to address product design and manufacturing process configurations concurrently in environments characterized by large degrees of product proliferation. Exploiting the intrinsic flexibility of product and process design, we present two approaches that synchronize production flows through the manufacturing system. These approaches integrate product and manufacturing system design decisions with operational concerns and provide powerful means for managing production in environments characterized by a proliferation of products. Experimental results show that the proposed methods can substantially reduce manufacturing lead times, work in process (WIP), and overall system complexity.

[1]  Paul D. Seymour,et al.  Packing directed circuits fractionally , 1995, Comb..

[2]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[3]  Reza H. Ahmadi,et al.  Design for synchronized flow manufacturing , 1994 .

[4]  Víctor Sandoval.  Computer Integrated Manufacturing (CIM) in Japan , 1994 .

[5]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[6]  P. T. Sokkalingam,et al.  The Minimal Feedback Arc Set Problems* , 2004 .

[7]  D. L. Marples,et al.  THE DECISIONS OF ENGINEERING DESIGN , 1961, IRE Transactions on Engineering Management.

[8]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[9]  R. Kaas,et al.  A branch and bound algorithm for the acyclic subgraph problem , 1981 .

[10]  Gilbert Laporte,et al.  Branch-and-bound algorithms for the multi-product assembly line balancing problem , 1989 .

[11]  Alexandre Dolgui,et al.  MIP approach to balancing transfer lines with blocks of parallel operations , 2006 .

[12]  Joseph D. Blackburn,et al.  Time-based competition: White-collar activities , 1992 .

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

[14]  Heungsoon Felix Lee,et al.  A line-balancing strategy for designing flexible assembly systems , 1991 .

[15]  James F. Korsh,et al.  A branch search algorithm for maximum likelihood paired comparison ranking , 1974 .

[16]  James J. Solberg,et al.  Effectiveness of flexible routing control , 1991 .

[17]  Walter Oberhofer,et al.  Zur Triangulation von Input-Output-Matrizen , 1968 .

[18]  M. Michael Umble,et al.  Synchronous Manufacturing: Principles for World Class Excellence , 1995 .

[19]  Wang Zheng-shan.  Improved algorithm for minimal feedback arc set based on stochastic evolution , 2008 .

[20]  Dorit S. Hochbaum,et al.  Methodologies and Algorithms for Group-Rankings Decision , 2006, Manag. Sci..

[21]  Udi Manber,et al.  Introduction to algorithms , 1989 .

[22]  U. Karmarkar,et al.  Lotsizing in Multi-Item Multi- Machine Job Shops , 1985 .

[23]  Patrick R. McMullen,et al.  Using Ant Techniques to Solve the Assembly Line Balancing Problem , 2003 .

[24]  Charles M. Eastman,et al.  Automatic Composition in Design , 1989 .

[25]  P. Gács,et al.  Algorithms , 1992 .

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

[27]  Anders Yeo,et al.  The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments , 2006, Combinatorics, Probability and Computing.

[28]  Subhash C. Sarin,et al.  A survey of the assembly line balancing procedures , 1998 .

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

[30]  A. A. Mastor,et al.  An Experimental Investigation and Comparative Evaluation of Production Line Balancing Techniques , 1970 .

[31]  E. Lawler.  A Comment on Minimum Feedback Arc Sets , 1964 .

[32]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[33]  A. Guénoche,et al.  Median linear orders: Heuristics and a branch and bound algorithm , 1989 .

[34]  Ezey M. Dar-El,et al.  Assembly line sequencing for model mix , 1975 .

[35]  Karl T. Ulrich,et al.  Product Design and Development , 1995 .

[36]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[37]  Stefan Bock,et al.  Using distributed search methods for balancing mixed-model assembly lines in the automotive industry , 2008, OR Spectr..

[38]  Kathryn E. Stecke,et al.  Design, planning, scheduling, and control problems of flexible manufacturing systems , 1985 .

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

[40]  Irène Charon,et al.  A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments , 2006, Discret. Appl. Math..

[41]  Christopher S. Tang,et al.  Product variety management : research advances , 1998 .

[42]  Christopher S. Tang,et al.  Modelling the Costs and Benefits of Delayed Product Differentiation , 1997 .

[43]  S. Kotha.  Mass Customization: The New Frontier in Business Competition , 1992 .

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

[45]  Fayez F. Boctor,et al.  A Multiple-rule Heuristic for Assembly Line Balancing , 1995 .