Simultaneous design of a product family and its related supply chain using a Tabu Search algorithm

Product family design is currently facing a multitude of challenges, the main problem stemming from the diversity offered to consumers. To design a product family, designers have to define an efficient bill of materials which ensures product assembly within a predefined length of time in order to satisfy the synchronised delivery principle. In addition, the modules used to assemble the finished products have to be competitive in terms of logistical costs. The ability to anticipate the constraints associated with the production process and with transportation is consequently of great interest. In this paper, we focus on the process of identifying a set of modules to be used in the assembly of the finished product. The objective is to define the bill of materials for each product from the modules belonging to that set, and to assign these modules to distant facilities where they will be manufactured and then shipped to a nearby facility for final assembly within a specific time. We use a set partitioning formulations to represent the problem, and solve it by adapting a Tabu Search algorithm in which the assembly process and the supply chain design are considered at the same time.

[1]  Sang Sheng-ju.  Research on Product Family Design for Mass Customization , 2007 .

[2]  Bruno Agard,et al.  A simulated annealing method based on a clustering approach to determine bills of materials for a large product family , 2009 .

[3]  S. Graves,et al.  Supply chain management : design, coordination and operation , 2003 .

[4]  Olivier Briant,et al.  The Optimal Diversity Management Problem , 2004, Oper. Res..

[5]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[6]  Rahul Rai,et al.  Modular product family design: Agent-based Pareto-optimization and quality loss function-based post-optimal analysis , 2003 .

[7]  Bruno Agard,et al.  GREEDY HEURISTICS FOR DETERMINING A PRODUCT FAMILY BILL OF MATERIALS , 2008 .

[8]  B. Montreuil,et al.  Demand and supply network design scope for personalized manufacturing , 2005 .

[9]  Fred Glover,et al.  Interactive decision software and computer graphics for architectural and space planning , 1985 .

[10]  B. Tabrizi,et al.  Defining next-generation products: an inside look. , 1997, Harvard business review.

[11]  B. Agard,et al.  Composition of modules' stock using simulated annealing , 2005, (ISATP 2005). The 6th IEEE International Symposium on Assembly and Task Planning: From Nano to Macro Assembly and Manufacturing, 2005..

[12]  Bruno Agard,et al.  Product and supply chain design using a taboo search , 2009 .

[13]  Khaled Hadj-Hamou,et al.  An optimization model for selecting a product family and designing its supply chain , 2006, Eur. J. Oper. Res..

[14]  Christopher S. Tang,et al.  On postponement strategies for product families with multiple points of differentiation , 1997 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Hau L. Lee,et al.  Mass Customization at Hewlett-Packard : The Power of Postponement , 1999 .

[17]  Alain Martel,et al.  Implications of personalization offers on demand and supply network design: A case from the golf club industry , 2006, Eur. J. Oper. Res..

[18]  Manoj Kumar Tiwari,et al.  An interactive particle swarm optimisation for selecting a product family and designing its supply chain , 2008, Int. J. Comput. Appl. Technol..

[19]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[20]  Bruno Agard,et al.  An experimental study for the selection of modules and facilities in a mass customization context , 2010, J. Intell. Manuf..

[21]  Bruno Agard,et al.  Composition of module stock for final assembly using an enhanced genetic algorithm , 2009 .

[22]  K. H. Kim,et al.  A heuristic for vehicle fleet mix problem using tabu search and set partitioning , 2008, J. Oper. Res. Soc..