Modeling multiple plant sourcing decisions

References

• Akçay , Y and Xu , SH . 2004 . Joint inventory replenishment and component allocation optimization in an assemble-to-order system . Mgmt Sci. , 50 : 99 – 116 .
   Web of Science ®Google Scholar
• Balas , E . 1965 . An additive alogrithm for solving linear programs with zero–one variables . Oper. Res. , 13 : 517 – 549 .
   Web of Science ®Google Scholar
• Balas , E and Martin , CH . 1980 . Pivot and complement—a heuristic for 0–1 programming . Mgmt Sci. , 26 : 86 – 96 .
   Web of Science ®Google Scholar
• Barragan , S , Cappellino , C , Dempsey , N and Rothenberg , S . 2003 . A framework for sourcing product development services . Supply Chain Mgmt: Int. J. , 8 : 271 – 280 .
   Google Scholar
• Beaujon , GJ , Marin , SP and McDonald , GC . 2001 . Balancing and optimizing a portfolio of r&d projects . Nav. Res. Logist. , 48 : 18 – 40 .
   Web of Science ®Google Scholar
• Beaumont , N and Sohal , A . 2004 . Outsourcing in Australia . Int. J. Oper. Prod. Mgmt , 24 : 688 – 700 .
   Web of Science ®Google Scholar
• Benjaafar , S , ElHafsi , M and de Véricourt , F . 2002 . Optimal stock allocation for a capcitated supply system . Mgmt Sci. , 48 : 1486 – 1501 .
   Google Scholar
• Bertsimas , D and Demir , R . 2002 . An approximate dynamic programming approach to multidimensional knapsack problems . Mgmt Sci. , 48 : 550 – 565 .
   Web of Science ®Google Scholar
• Cãnez , LE , Platts , KW and Probert , DR . 2000 . Developing a framework for make-or-buy decisions . Int. J. Oper. Prod. Mgmt , 20 : 1313 – 1330 .
   Web of Science ®Google Scholar
• Cherbaka , NS and Meller , RD . 2006 . “ Single plant sourcing decisions with a multidimensional knapsack model ” . Blacksburg, VA : Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University . Working paper
   Google Scholar
• Cherbaka , NS , Meller , RD and Sherali , HD . 2006 . “ Difficult multidimensional knapsack problems and a heuristic algorithm for applications to sourcing problems ” . Blacksburg, VA : Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University . Working paper
   Google Scholar
• Chu , PC and Beasley , JE . 1998 . A genetic algorithm for the multidimensional knapsack problem . J. Heurist. , 4 : 63 – 86 .
   Web of Science ®Google Scholar
• Dammeyer , F and Voß , S . 1993 . Dynamic tabu list management using reverse elimination method . Ann. Oper. Res. , 41 : 31 – 46 .
   Google Scholar
• de Véricourt , F , Karaesmen , F and Dallery , Y . 2002 . Optimal stock allocation for a capcitated supply system . Mgmt Sci. , 48 : 1486 – 1501 .
   Web of Science ®Google Scholar
• Dekkers , R . 2002 . Strategic capacity management: meeting technological demands and performance criteria . Int. J. Prod. Res. , 40 : 3895 – 3911 .
   Web of Science ®Google Scholar
• Freling , R , Romeign , HE , Morales , DR and Wagelmans , APM . 2003 . A branch-and-price algorithm for the multiperiod single-sourcing problem . Oper. Res. , 51 : 922 – 939 .
   Web of Science ®Google Scholar
• Fréville , A . 2004 . The multidimensional 0–1 knapsack problem: an overview . Eur. J. oper. Res. , 155 : 1 – 21 .
   Web of Science ®Google Scholar
• Fréville , A and Plateau , G . 1990 . Hard 0–1 multiknapsack test problems for size reduction methods . Invest. Oper. , 1 : 251 – 270 .
   Google Scholar
• Gabrel , V and Minoux , M . 2002 . A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems . Oper. Res. Lett. , 30 : 252 – 264 .
   Web of Science ®Google Scholar
• Garey , MD and Johnson , DS . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , San Francisco : Freeman .
   Google Scholar
• Gavish , B and Pirkul , H . 1985 . Efficient algorithms for solving multiconstraint zero–one knapsack problems to optimality . Math. Progr. , 31 : 78 – 105 .
   Web of Science ®Google Scholar
• Gilmore , PC and Gomory , RE . 1966 . The theory and computation of knapsack functions . Oper. Res. , 14 : 1045 – 1075 .
   Web of Science ®Google Scholar
• Glover , F and Kochenberger , GA . 1996 . “ Critical event tabu search for multidimensional knapsack problems. ” . In Meta-Heuristics Theory and Applications , Edited by: Kelly , JP and Osman , IH . 407 – 427 . Boston, MA : Kluwer Academic Publishers .
   Google Scholar
• Hanafi , S and Fréville , A . 1997 . An efficient tabu search approach for the 0–1 multidimensional knapsack problem . Eur. J. oper. Res. , 106 : 659 – 675 .
   Google Scholar
• Hifi , M , Michrafy , M and Sbihi , A . 2004 . Heuristic algorithms for the multiple-choice multidimensional knapsack problem . J. oper. Res. Soc. , 55 : 1323 – 1332 .
   Web of Science ®Google Scholar
• Huang , W , Romeijn , HE and Geunes , J . 2005 . The continuous-time single-sourcing problem with capacity expansion opportunities . Nav. Res. Logist. , 52 : 193 – 211 .
   Web of Science ®Google Scholar
• Humphreys , P , McIvor , R and Huang , G . 2002 . An expert system for evaluating the make or buy decision . Comput. ind. Engng , 42 : 567 – 585 .
   Web of Science ®Google Scholar
• Insinga , R and Werle , M . 2000 . Linking outsourcing to business strategy . Acad. Mgmt , 14 : 58 – 70 .
   Web of Science ®Google Scholar
• Jennings , D . 1996 . Outsourcing opportunities for financial services . Long Range Plann. , 29 : 393 – 404 .
   Google Scholar
• Jolayemi , JK and Olorunniwo , FO . 2004 . A deterministic model for planning production quantities in a multi-plant, multi-warehouse environment with extensible capacities . Int. J. Prod. Econ. , 87 : 99 – 113 .
   Web of Science ®Google Scholar
• Khan , S , Li , KF , Manning , EG and Akbar , MM . 2002 . Solving the knapsack problem for adaptive miltimedia system . Stud. Inform. , 2 : 155 – 177 .
   Google Scholar
• Li , VC , Curry , GL and Boyd , EA . 2004 . Towards the real time solution of strike force asset allocation problems . Comput. Oper. Res. , 31 : 273 – 291 .
   Web of Science ®Google Scholar
• Lorie , J and Savage , LJ . 1955 . Three problems in capital rationing . J. Bus. , 28 : 229 – 239 .
   Web of Science ®Google Scholar
• Loulou , R and Michaelides , E . 1979 . New greedy-like heuristics for the multidimensional zero–one knapsack problem . Oper. Res. , 27 : 1101 – 1114 .
   Web of Science ®Google Scholar
• Magazine , MJ and Oguz , O . 1984 . A heuristic algorithm for the multidimensional zero–one knapsack problem . Eur. J. oper. Res. , 16 : 319 – 326 .
   Google Scholar
• Maister , DH . 1975 . Centralisation of inventories and the ‘square root law’ . Int. J. phys. Distr. Mater. Mgmt , 6 : 124 – 134 .
   Google Scholar
• Mansini , R and Speranza , MG . 2002 . A multidimensional knapsack model for asset-backed securitization . J. oper. Res. Soc. , 53 : 822 – 832 .
   Web of Science ®Google Scholar
• Momme , J . 2001 . “ Outsourcing manufacturing to suppliers—a practical framework ” . In 4th SMESME International Conference
   Google Scholar
• Moraga , RJ , DePuy , GW and Whitehouse , GE . 2005 . Meta-raPS approach for the 0–1 multidimensional knapsack problem . Comput. ind. Engng , 48 : 83 – 96 .
   Web of Science ®Google Scholar
• Nadkarni , S and Shenoy , PP . 2004 . A casual mapping approach to constructing Bayesian networks . Decis. Supp. Syst. , 38 : 259 – 281 .
   Web of Science ®Google Scholar
• Nemhauser , GL and Ullmann , Z . 1969 . Discrete dynamic programming and capital allocation . Mgmt Sci. , 15 : 494 – 505 .
   Web of Science ®Google Scholar
• OR-Library . 2005 . http://www.brunel.ac.uk/depts/ma/research/jeb/orlib/mknapinfo.html
   Google Scholar
• Senju , S and Toyoda , Y . 1968 . An approach to linear programming with 0–1 variables . Mgmt Sci. , 15 : 196 – 207 .
   Web of Science ®Google Scholar
• Shabany , M , Navaie , K and Sousa , E . 2004 . “ Downlink resource allocation for data traffic in heterogenous cellular cdma networks ” . In 9th International Symposium on Computers and Communications 436 – 441 .
   Google Scholar
• Shih , W . 1979 . A branch and bound method for the multiconstraint zero–one knapsack problem . J. oper. Res. Soc. , 30 : 369 – 378 .
   Web of Science ®Google Scholar
• Soyster , AL , Lev , B and Slivka , W . 1977 . Zero–one programming with many variables and few constraints . Eur. J. oper. Res. , 2 : 195 – 201 .
   Google Scholar
• Toyoda , Y . 1975 . A simplified algorithm for obtaining approximate solutions to zero–one programming problems . Mgmt Sci. , 21 : 1417 – 1427 .
   Web of Science ®Google Scholar
• Vankatesan , R . 1992 . Strategic sourcing: to make or not to make . Harv. Bus. Rev. ,
   Google Scholar
• Vasquez , M and Hao , J . 2001 . A hybrid approach for the 0–1 multidimensional knapsack problem . RAIRO; Oper. Res. , 106 : 659 – 675 .
   Google Scholar
• Vasquez , M and Vimont , Y . 2005 . Improved results on the 0–1 multidimensional knapsack problem . Eur. J. oper. Res. , 165 : 70 – 81 .
   Web of Science ®Google Scholar
• Weingartner , HM . 1963 . Mathematical Programming and the Analysis of Capital Budgeting Problems , Englewood Cliffs, NJ : Prentice-Hall .
   Google Scholar
• Weingartner , HM and Ness , DN . 1967 . Methods for the solution of the multidimensional 0/1 knapsack problem . Oper. Res. , 15 : 83 – 103 .
   Web of Science ®Google Scholar