Production planning with flexible customization using a branch-price-cut method

We consider a production planning problem of an assembly item, where each component of the item has several different versions. In flexible customization, rather than specifying only one version for each component, customers are willing to accept any variation of the product complying with their customization rules. The problem of constructing the final assembly production plan in such a setting is addressed by matching the available machines and other manufacturing resources to meet the demands with flexible customization. A branch-price-cut method to solve this problem without using auxiliary binary variables is developed and computational examples of the implementation of the method are presented.

[1]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[2]  R. Garud,et al.  Changing competitive dynamics in network industries: An exploration of sun microsystems' open systems strategy , 1993 .

[3]  George L. Nemhauser,et al.  Branch-and-cut for combinatorial optimization problems without auxiliary binary variables , 2001, The Knowledge Engineering Review.

[4]  George L. Nemhauser,et al.  A polyhedral approach to combinatorial complementarity programming problems , 1995 .

[5]  S. Thomas McCormick,et al.  Integer Programming and Combinatorial Optimization , 1996, Lecture Notes in Computer Science.

[6]  R. Balachandra,et al.  Modular Design and Technological InnovationThe Case of the Hard Disk Drives , 2002 .

[7]  Loo Hay Lee,et al.  Production planning with approved vendor matrices for a hard-disk drive manufacturer , 2005, Eur. J. Oper. Res..

[8]  Gabriel R. Bitran,et al.  Ordering Policies in an environment of Stochastic Yields and Substitutable Demands , 1992, Oper. Res..

[9]  Stuart Brown,et al.  Process Planning for Aluminum Tubes: An Engineering-Operations Perspective , 1996, Oper. Res..

[10]  George L. Nemhauser,et al.  A generalized assignment problem with special ordered sets: a polyhedral approach , 2000, Math. Program..

[11]  Daniel Bienstock,et al.  Computational Study of a Family of Mixed-Integer Quadratic Programming Problems , 1995, IPCO.

[12]  Alper Atamtürk.  Cover and Pack Inequalities for (Mixed) Integer Programming , 2005, Ann. Oper. Res..

[13]  George L. Nemhauser,et al.  Facets of the Complementarity Knapsack Polytope , 2002, Math. Oper. Res..

[14]  D. Simchi-Levi,et al.  On assemble-to-order systems with flexible customers , 2003 .

[15]  E.M.L. Beale,et al.  Branch and Bound Methods for Mathematical Programming Systems , 1977 .

[16]  Karla Hoffman,et al.  A Column-Generation and Branch-and-Cut Approach to the Bandwidth-Packing Problem , 2006, Journal of research of the National Institute of Standards and Technology.

[17]  Ellis L. Johnson,et al.  Solving Large-Scale Zero-One Linear Programming Problems , 1983, Oper. Res..

[18]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[19]  Joseph Geunes,et al.  Production Planning with Flexible Product Specifications: An Application to Specialty Steel Manufacturing , 2003, Oper. Res..

[20]  Gabriel R. Bitran,et al.  Deterministic approximations to co-production problems with service constraints , 1992 .

[21]  Bjorn Andersen,et al.  Modelling Product Structures by Generic Bills-of-Materials. , 1993 .

[22]  Gabriel R. Bitran,et al.  Co-Production Processes with Random Yields in the Semiconductor Industry , 1994, Oper. Res..

[23]  Ron Sanchez,et al.  Modularity, flexibility, and knowledge management in product and organization design , 1996 .

[24]  Alison McKay,et al.  Product modelling using multiple levels of abstraction: instances as types , 1994 .

[25]  Toshihide Ibaraki.  APPROXIMATE ALGORITHMS FOR THE MULTIPLE-CHOICE CONTINUOUS KNAPSACK PROBLEMS , 1980 .

[26]  Pamela H. Vance,et al.  Crew scheduling, cutting stock, and column generation :Solving huge integer programs , 1993 .