Quantitative methods in supply chain management: Models and algorithms

Quantitative Methods in Supply Chain Management: Models and Algorithms

Volumn 9780857297662, Issue , 2012, Pages 1-397

  Christou, Ioannis T ^a  

^a ATHENS INFORMATION TECHNOLOGY   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; DYNAMIC PROGRAMMING; FORECASTING; HEURISTIC METHODS; INDUSTRIAL RESEARCH; NONLINEAR PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION CONTROL; SCHEDULING; STOCHASTIC CONTROL SYSTEMS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; VEHICLE ROUTING;

DISTRIBUTION MANAGEMENT; HIGH-QUALITY SOLUTIONS; NON-LINEAR OPTIMIZATION ALGORITHMS; PERIODIC REVIEW SYSTEMS; PLANNING AND SCHEDULING; TIME SERIES FORECASTING; TRANSPORTATION PROBLEM; VEHICLE ROUTING PROBLEMS;

SUPPLY CHAIN MANAGEMENT;

EID: 84949176204     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-85729-766-2     Document Type: Book

References (231)

1. Achterberg T (2007) Constraint integer programming. Ph. D. dissertation, Technical University of Berlin, Germany
2. Achterberg T, Berthold T (2009) Hybrid branching. Lecture Notes in Computer Science. Springer, Heildelberg, 5547:309-311
3. Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33(1):42-54
4. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs
5. Al-Baali M, Fletcher R (1986) An efficient line-search for nonlinear least squares. J Optim Theory Appl 48:359-377
6. Anbil R, Gelman E, Patty B, Tanga R (1991) Recent advances in crew-pairing optimization at American airlines. Interfaces 21:62-74
7. Apostol TM (1962) Calculus. Blaisdel Publishing, NY
8. Apostol TM (1981) Mathematical analysis, 2nd edn. Addison-Wesley, Reading
9. Armijo L (1966) Minimization of a function having Lipschitz continuous first partial derivatives. Pac J Math 16(1):1-3
10. Aydin ME, Fogarty TC (2004) A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. J Heuristics 10(3):269-292
11. Balas E (1965) An additive algorithm for solving linear programs with zero-one variables. Oper Res 13(4):517-546
12. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh M W P, Vance PH (1998) Branch-andprice: column generation for solving huge integer programs. Oper Res 46(3):316-329
13. Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origindestination integer multi-commodity flow problems. Oper Res 48(2):318-326
14. Bellman R (1957) Dynamic programming. Princeton University Press, Princeton
15. Bertsekas DP (1982) Constrained optimization and lagrange multiplier methods. Academic Press, New York
16. Bertsekas DP (1988) The auction algorithm: a distributed relaxation method for the assignment problem. Ann Oper Res 14(1):105-123
17. Bertsekas DP (1991) Linear network optimization: algorithms and codes. MIT Press, Cambridge
18. Bertsekas DP (1995) Nonlinear programming. Athena Scientific, Belmont
19. Bertsekas DP (2001) Dynamic programming and optimal control, vol 2, 2nd edn. Athena Scientific, Belmont
20. Bertsekas DP (2005) Dynamic programming and optimal control, vol 1, 3rd edn. Athena Scientific, Belmont
21. Bertsekas DP, Tsitsiklis JN (1989) Parallel and distributed computation: numerical methods. Prentice-Hall, Englewood Cliffs
22. Broyden CG (1970) The convergence of a class of double rank minimization algorithms, in two parts. J Inst Math Appl 6:76-90
23. Cheney W, Kincaid D (1994) Numerical mathematics and computing, 3rd edn. Brooks/Cole Publishing Company, Pacific Grove, CA
24. Chvatal V (1983) Linear programming. W. H. Freeman and Co, NY
25. Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8(1):101-111
26. Darwin R (1861) On the origin of species by means of natural selection, or the preservation of favoured races in the struggle for life. J Murray, UK
27. De Leone R, Meyer RR, Kontogiorgis S, Zakarian A, Zakeri G (1994) Coordination in coarsegrained decomposition. SIAM J Optim 4(4):777-793
28. De Leone R, Meyer RR, Zakarian A (1999) A partitioned ε-relaxation algorithm for separable convex network flow problems. Comput Optim Appl 12:107-126
29. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269-271
30. Ferris MC, Wathen AJ, Armand P (2007) Limited memory solution of box-constrained convex quadratic problems arising in video games. RAIRO Oper Res 41:19-34
31. Festa P, Resende M G C (2009) Hybrid GRASP heuristics. In: Abraham A, Hassanien A-E, Siarry P, Engelbrecht A (eds) Foundations of computational intelligence, vol 3: Global Optimization. Springer, Berlin
32. Fletcher R (1970) A new approach to variable metric algorithms. Comput J 13:317-322
33. Fletcher R (1987) Practical methods of optimization, 2nd edn. Wiley, Chichester
34. Fletcher R (2000) Practical methods of optimization, 3rd edn. Wiley, Chichester
35. Ford LR Jr, Fulkerson DR (1962) Flows in networks. Princeton University Press, Princeton
36. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co, NY
37. Gill PE, Murray W, Wright MH (1982) Practical optimization. Emerald, West Yorkshire
38. Glover F (1989) Tabu search, part I. ORSA J Comput 1:190-206
39. Glover F (1998) A template for scatter search and path relinking. Lecture Notes in Computer Science. Springer, Heidelberg, 1363:13-54
40. Glover F, Marti R (2006) Tabu search. In: Meta-heuristic procedures for training neural networks. Springer, Berlin
41. Goldfarb D (1970) A family of variable metric methods derived by variational means. Math Comput 24:23-26
42. Goldstein AA (1965) On steepest descent. SIAM J Control 3:147-151
43. Gomory RE (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64:275-278
44. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
45. Hopp W, Spearman M (2008) Factory physics, 3rd edn. McGraw-Hill/Irwin, NY
46. Kennington JL (1989) Using KORBX for military airlift applications. In: Proceedings of the 28th IEEE conference on decision and control, Tampa, FL, 13-15 December 1989
47. Kirkpatrick SC, Gellatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671-680
48. Koza J, Poli R (2005) Genetic programming. In: Burke EK, Kendall G (eds) Search methodologies: introductory tutorials in optimization and decision support techniques. Springer, Berlin
49. Lowerre B (1976) The Harpy speech recognition system. Ph. D. dissertation, Carnegie-Mellon University
50. Luenberger DG (1969) Optimization by vector space methods. Wiley, NY
51. Mangasarian OL (1994) Nonlinear programming. SIAM, Philadelphia
52. Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13(1):182-196
53. Meyer RR (1992) Lecture notes on integer programming. Dept Comput Sci, University of Wisconsin-Madison
54. Michalewicz Z (1994) Genetic algorithms + data structures = evolution programs, 2nd edn. Springer, Berlin
55. Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, NY
56. Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover, Mineola
57. Rechenberg I (1973) Evolutionsstrategie: optimierung technisquer systeme nach prinzipien der biologischen evolution. Frommann-Holzboog, Stuttgart, Germany (in German)
58. Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
59. Ryan DM, Foster BA (1981) An integer programming approach to scheduling. In: Wren A (ed) Computer scheduling of public transport urban passenger vehicle and crew scheduling. North-Holland, Amsterdam
60. Schultz GL, Meyer RR (1989) A three-phase algorithm for block-structured optimization. In: Proceedings of the 4th SIAM conference on parallel processing for scientific computing, pp 186-191, Philadelphia, PA
61. Schwefel HP (1981) Numerical optimization of computer models. Wiley, NY
62. Shanno DF (1970) Conditioning of quasi-Newton methods for function minimization. Math Comput 24:647-656
63. Shi L, Olafsson S (2000) Nested partitions method for global optimization. Oper Res 48(3):390-407
64. Storm R, Price K (1997) Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11(4):341-359
65. Vanden Berghen F (2004) CONDOR: A constrained nonlinear derivative-free parallel optimizer for continuous high-computing load, noisy objective functions. Ph. D. dissertation, Universite Libre de Bruxelles, Belgium
66. Box G E P, Jenkins GM (1976) Time series analysis: forecasting and control. Holden Day, San Francisco CA
67. Box G E P, Jenkins GM, Reinsel GC (2008) Time series analysis: forecasting and control., 4th edn. Wiley, Hoboken, NJ
68. Brown RG (1962) Smoothing, forecasting and prediction of discrete time series. Prentice-Hall, Englewood Cliffs, NJ
69. Cheney W, Kincaid D (1994) Numerical mathematics and computing, 3rd edn. Brooks/Cole Publishing Company, Pacific Grove, CA
70. Durbin J (1960) The fitting of time-series models. Rev Int Stat Inst 28:233-244
71. Ghiani G, Laporte G, Musmanno R (2004) Introduction to logistics systems planning and control. Wiley, Chichester, UK
72. Halikias I (2003) Statistics: analytic methods for business decisions, 2nd edn. Rosili, Athens, Greece (in Greek)
73. Holt CC (1957) Forecasting trends and seasonals by exponentially weighted moving averages. O. N. R. Memorandum 52, Carnegie Institute of Technology, Pittsburgh
74. Kalman RE (1960) A new approach to linear filtering and prediction problems. J Basic Eng 82:35-45
75. Karagiannis G (1988) Digital signal processing. National Technical University of Athens, Athens, Greece (in Greek)
76. Luo Y (2010) Time series forecasting using forecasting ensembles. M. Sc. thesis, Information Networking Institute, Carnegie-Mellon University
77. Makridakis S, Wheelwright SC, Hyndman RJ (1998) Forecasting: methods and applications, 3rd edn. Wiley, Hoboken, NJ
78. Minsky M, Papert S (1969) Perceptrons. MIT Press, Cambridge, MA
79. Palit AK, Popovic D (2005) Computational intelligence in time series forecasting: theory and applications. Springer, Berlin, Germany
80. Rumelhart DE, McClelland JL et al (1987) Parallel distributed processing: explorations in the micro-structure of cognition, volume I: foundations. MIT Press, Cambridge, MA
81. Sanders NR, Manrodt KB (1994) Forecasting practices in US corporations: survey results. Interfaces 24(2):92-100
82. Schuster A (1906) On the periodicities of sunspots. Philos Trans R Soc A 206:69
83. Shi S, Liu B (1993) Nonlinear combination of forecasts with neural networks. In: Proceedings of the international joint conference on neural networks, Nagoya, Japan
84. Tzafestas S, Tzafestas E (2001) Computational intelligence techniques for short-term electric load forecasting. J Intell Robot Syst 31(1-3):7-68
85. Vapnik VN (1995) The nature of statistical learning theory. Springer, New York
86. Walker G (1931) On periodicity in series of related terms. Proc R Soc A 131:195-215
87. Winkler R, Makridakis S (1983) The combination of forecasts. J R Stat Soc Ser A 137:131-165
88. Winters PR (1960) Forecasting sales by exponentially weighted moving averages. Manag Sci 6(3):324-342
89. Wolfers J, Zitzewitz E (2007) Interpreting prediction markets as probabilities. NBER working paper #12200, The Wharton school of business, University of Pennsylvania
90. Yong Y (2000) Combining different procedures for adaptive regression. J Multivar Anal 74:135-161
91. Yule GU (1927) On a method of investigating periodicities in disturbed series with special reference to Wolfer's sunspot numbers. Philos Trans R Soc A 226:267-298
92. Aiex RM, Binato S, Resende M G C (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29:393-430
93. Apostolopoulos P (2008) A decision making system for orders for the pull-based part of the available-to-promise strategy. M. Sc. thesis, Athens Information Technology
94. Aydin ME, Fogarty TC (2004) A distributed evolutionary simulated annealing algorithm for combinatorial optimisation problems. J Heuristics 10:269-292
95. Ball MO, Chen C-Y, Zhao Z-Y (2004) Available to promise. In: Simchi-Levi D, Wu SD, Shen ZM (eds) Handbook of quantitative supply chain analysis: modeling in the e-business era. Springer, NY
96. Bilgen B, Gunther H-O (2009) Integrated production and distribution planning in the fast moving consumer goods industry: a block planning application. OR Spectrum, 18 June 2009
97. Binato S, Hery W, Loewenstern D, Resende M G C (2001) GRASP for job shop scheduling. In: Essays and surveys on meta-heuristics. Kluwer, Amsterdam
98. Blackstone JH, Cox JF (2004) APICS Dictionary, 11th edn. McGraw Hill, Falls Church
99. Brizuela CA, Sannomiya N (2000) A selection scheme in genetic algorithms for a complex scheduling problem. In: Proceedings of the GECCO 2000 genetic and evolutionary computation conference, Las Vegas, NV
100. Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discret Appl Math 49:107-127
101. Chen C-Y, Zhao Z-Y, Ball MO (2001) Quantity and due-date quoting available to promise. Inform Syst Frontiers 3(4):477-488
102. Chen C-Y, Zhao Z-Y, Ball MO (2002) A model for batch advanced available to promise. Prod Oper Manag 11(4):424-440
103. Chen-Ritzo C-H (2006) Availability management for configure-to-order supply chain systems. Ph. D. dissertation, College of Business Administration, Pennsylvania state University
104. Christopher M (2005) Logistics and supply chain management: creating value-adding networks, 3rd edn. Prentice-Hall, Harlow
105. Christou IT, Ponis S (2008) Enhancing traditional ATP functionality in open source ERP systems: a case-study from the food and beverages industry. Int J Enterp Inf Syst 4(1):18-33
106. Christou IT, Ponis S (2009) A hierarchical system for efficient coordination of available-topromise logic mechanisms. Int J Prod Res 47(11):3063-3078
107. Christou IT, Zakarian A (2000) Domain knowledge and representation issues in genetic algorithms for scheduling problems. In: Proceedings of the GECCO 2000 genetics and evolutionary computation conference, Las Vegas, NV
108. Christou IT, Zakarian A, Liu J-M, Carter H (1999) A two phase genetic algorithm for solving large scale bid-line generation problems at Delta Air Lines. Interfaces 29(5):51-65
109. Christou IT, Lagodimos AG, Lycopoulou D (2007) Hierarchical production planning for multiproduct lines in the beverage industry. J Prod Plan Control 18(5):367-376
110. Dorndorf U, Pesch E (1995) Evolution based learning in a job-shop scheduling environment. Comput Oper Res 22:25-40
111. Ervolina T, Dietrich B (2001) Moving toward dynamic available to promise. In: Gass PI, Jones AT (eds) Supply chain management practice and research: status and future directions. Manufacturing Engineering Laboratory, RH School of Business, University of Maryland
112. Fernandes S, Lourenco HR (2007) A GRASP and branch-and-bound meta-heuristic for job shop scheduling. Lecture notes in computer science, vol 4446, pp 60-71
113. French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job shop. E. Horwood, Chichester
114. Friedrich J-M, Speyerer J (2002) XML-based available-to-promise logic for small and medium enterprises. In: Proceedings of the 35th international conference on system sciences, Hawaii, HW
115. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman, NY
116. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan A H G (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287-326
117. Hopp W, Spearman M (2008) Factory physics, 3rd edn. McGraw-Hill/Irwin, NY
118. Keskinocak P, Tayur S (2004) Due date management policies. In: Simchi-Levi D, Wu SD, Shen ZM (eds) Handbook of quantitative supply chain analysis: modeling in the e-business era. Springer, NY
119. Kilger C, Schneeweiss L (2005) Demand Fulfillment and ATP. In: Stadtler H, Kilger C (eds) Supply chain management and advanced planning: concepts, models, software and case studies, 3rd edn. Springer, Berlin
120. Kolonko M (1999) Some new results on simulated annealing applied to the job shop scheduling problems. Eur J Oper Res 113:123-136
121. Lawler EL (1982) Preemptive scheduling of precedence-constrained jobs on parallel machines. In: Dempster MAH, Lenstra JK, Rinnooy Kan AHG (eds) Deterministic and Stochastic Scheduling. D Reidel Publishing Company, Dordrecht
122. Lee DS, Vassiliadis VS, Park JM (2004) A novel threshold accepting meta-heuristic for the jobshop scheduling problem. Comput Oper Res 31:2199-2213
123. Lenstra JK, Rinnooy Kan A H G (1979) Computational complexity of discrete optimization problems. Ann Discret Math 4:121-140
124. Mattfeld DC (1996) Evolutionary search and the job shop: investigations on genetic algorithms for production scheduling. Physica-Verlag, Heidelberg
125. Nanda R, Browne J (1992) Introduction to employee scheduling. Van Nostrand-Reinhold, NY
126. Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8:145-159
127. Pardalos PM, Shylo O (2006) An algorithm for the job shop scheduling problem based on global equilibrium search techniques. Comput Manag Sci 3(4):331-348
128. Pinedo M (2008) Scheduling: theory, algorithms and systems. Springer, NY
129. Sevkli M, Aydin ME (2006) A variable neighborhood search algorithm for job shop scheduling problems. Lecture notes in computer science, vol 3906, pp 261-271
130. Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling, 3rd edn. Wiley, Hoboken
131. Smith B, Leimkuhler J, Darrow R, Samuels J (1992) Yield management at American Air-Lines. Interfaces 22:8-31
132. Taillard ED (1994) Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6:108-117
133. Tarantilis CD, Kiranoudis CT (2002) A list-based threshold accepting method for the job-shop scheduling problems. Int J Prod Econ 77:159-171
134. Van Laarhoven P J M, Aarts E H L, Lenstra JK (1992) Job shop scheduling by simulated annealing. Oper Res 40:113-125
135. Vásquez M, Whitley L (2000) A comparison of genetic algorithms for the static job shop scheduling problem. In: Proceedings of the 6th parallel problem solving from nature conference, PPSN VI
136. Wagner HM, Whitin T (1958) Dynamic version of the economic lot size model. Manag Sci 5:89-96
137. Watson J-P, Beck J, Howe A, Whitley L (2003) Problem difficulty for tabu search in job-shop scheduling. Artif Intell 143(2):189-217
138. Wu A, Chiang D, Chang C-W (2010) Using order admission control to maximize revenue under capacity utilization requirements in MTO B2B industries. J Oper Res Soc Jpn 53(4):38-44
139. Zhao Z, Ball MO, Kotake M (2005) Optimization-based available-to-promise with multi-stage resource availability. Ann Oper Res 135(1):65-85
140. Zobolas GI, Tarantilis CD, Ioannou G (2009) A hybrid evolutionary algorithm for the job-shop scheduling problem. J Oper Res Soc 60:221-235
141. Abdel-Malek L, Montanari R (2005) An analysis of the multi-product newsboy problem with a budget constraint. Int J Prod Econ 97:296-307
142. Apostol TM (1981) Mathematical analysis, 2nd edn. Addison-Wesley, Reading
143. Arrow KJ, Harris T, Marschak J (1951) Optimal inventory policy. Econometrica 19:250-272
144. Arrow KJ, Karlin S, Scarf H (1958) Studies in the mathematical theory of inventory and production. Stanford University Press, Stanford
145. Axsater S (1990) Simple solution procedure for a class of two-echelon inventory problems. Oper Res 38(1):64-69
146. Axsater S (2010) Inventory control. Springer, NY
147. Bell CE (1970) Improved algorithms for inventory and replacement stock problems. SIAM J Appl Math 18(3):682-687
148. Browne S, Zipkin P (1991) Inventory models with continuous stochastic demands. Ann Appl Probab 1(3):419-435
149. Chang Y-L, Desai K (2003) WinQSB: decision support software for MS/OM. Wiley, Hoboken
150. Clark A, Scarf H (1960) Optimal policies for a multi-echelon inventory problem. Manag Sci 6(4):475-490
151. Daganzo C (2003) A theory of supply chains. Springer, Berlin
152. Diks EB, de Kok AG (1998) Optimal control of a divergent multi-echelon inventory system. Eur J Oper Res 111(1):75-97
153. Diks EB, de Kok AG (1999) Computational results for the control of a divergent N-echelon inventory system. Int J Prod Econ 59(1-3):327-336
154. Federgruen A, Zipkin P (1984) Computational issues in an infinite horizon multi-echelon inventory model. Oper Res 32(4):818-836
155. Federgruen A, Zipkin P (1985) Computing optimal (s, S) policies in inventory systems with continuous demands. Adv Appl Probab 17:421-442
156. Forrester JW (1961) Industrial dynamics. Pegasus Communications Publishing Company, Waltham
157. Gallego G (2004) Lecture notes on production management. Department of Industrial Engineering & Operations Research, Columbia University
158. Galliher HP, Morse PM, Simond M (1957) Dynamics of two classes of continuous review inventory systems. Operat Res 7(3):362-384
159. Hadley G, Whitin TM (1961) A family of inventory models. Manag Sci 7(4):351-371
160. Hadley G, Whitin TM (1963) Analysis of inventory systems. Prentice-Hall, Englewood-Cliffs
161. Harris FW (1913) How many parts to make at once. Factory: the Magazine of Management, 10(2):135-136, 152
162. Harris FW (1915) Operations and cost (factory management series). A. W. Shaw, Chicago
163. Hill RM (2006) Inventory control with indivisible units of stock transfer. Eur J Oper Res 175:593-601
164. Hopp W, Spearman M (2008) Factory physics, 3rd edn. McGraw-Hill/Irwin, NY
165. Iglehart DL (1963) Optimality of (s, S) policies in the infinite horizon dynamic inventory problem. Manag Sci 9(2):259-267
166. Johnson E (1968) On (s, S) policies. Manag Sci 15(1):80-101
167. Lagodimos AG, Christou IT, Skouri K (2010a) Optimal (r, nQ, T) inventory control policies under stationary demand. Int J Syst Sci (to appear)
168. Lagodimos AG, Christou IT, Skouri K (2010b) Optimal (r, nQ, T) batch ordering with quantized supplies. Comput Oper Res (to appear)
169. Lagodimos AG, Christou IT, Skouri K (2011) A simple procedure to compute optimal (s, S, T) inventory policy. In: Proceedings of the international conference on challenges in statistics and operations research, Kuwait, 8-10 March 2011
170. Larsen C, Kiesmuller GP (2007) Developing a closed-form cost expression for a (R, s, nQ) policy where the demand process is compound generalized Erlang. Oper Res Lett 35(5):567-572
171. Lau HS, Lau A H L (1996) The newsstand problem: a capacitated multi-product single-period inventory problem. Eur J Oper Res 94:29-42
172. Li X, Sridharan V (2008) Characterizing order processes of using (R, nQ) inventory policies in supply chains. Omega 36(6):1096-1104
173. Morse PM (1959) Solutions of a class of discrete time inventory problems. Oper Res 7(1):67-78
174. Naddor E (1975) Optimal and heuristic decisions in single- and multi-item inventory systems. Manag Sci 24:1766-1768
175. Porteus E (2002) Foundations of stochastic inventory theory. Stanford Business Books, Stanford
176. Rao U (2003) Properties of the (R, T) periodic review inventory control policy for stationary stochastic demand. Manuf Serv Oper Manag 5(1):37-53
177. Reis DA (1982) Comparison of periodic review operating doctrines: a simulation study. In: Proceedings of the 1982 winter simulation conference
178. Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton
179. Rosling K (1989) Optimal inventory policies for assembly systems under random demands. Oper Res 37(4):565-579
180. Roundy R (1985) 98%-Effective integer-ratio lot sizing for one-warehouse multi-retailer systems. Manag Sci 31(11):1416-1430
181. Scarf H (1959) The optimality of (S, s) policies in dynamic inventory problems. Technical report no. 11, Applied Mathematics & Statistics Laboratory, Stanford University
182. Serfozo R, Stidham S (1978) Semi-stationary clearing processes. Stoch Process Appl 6(2):165-178
183. Sherbrooke CC (2004) Optimal inventory modeling of systems: multi-echelon techniques, 2nd edn. Kluwer, NY
184. Silver EA, Robb DJ (2008) Some insights regarding the optimal reorder period in periodic review inventory systems. Int J Prod Econ 112(1):354-366
185. Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling. Wiley, Hoboken
186. Stidham S Jr (1977) Cost models for stochastic clearing systems. Oper Res 25(1):100-127
187. Stidham S Jr (1986) Clearing systems and (s, S) systems with nonlinear costs and positive lead times. Oper Res 34(2):276-280
188. Veinott AF Jr (1965) The optimal inventory policy for batch ordering. Oper Res 13(3):424-432
189. Veinott AF Jr (1966) On the optimality of (s, S) inventory policies: new conditions and a new proof. SIAM J Appl Math 14(5):1067-1083
190. Veinott AF Jr, Wagner HM (1965) Computing optimal (s, S) inventory policies. Manag Sci 11(5):525-552
191. Zhang B, Du S (2010) Multi-product newsboy problem with limited capacity and outsourcing. Eur J Oper Res 202:107-113
192. Zheng Y-S (1992) On properties of stochastic inventory systems. Manag Sci 38(1):87-103
193. Zheng Y-S, Chen F (1992) Inventory policies with quantized ordering. Nav Res Logist Q 39:285-305
194. Zheng Y-S, Federgruen A (1991) Finding optimal (s, S) policies is about as simple as evaluating a single (s, S) policy. Oper Res 39(4):654-665
195. Zipkin P (1986) Inventory service level measures: convexity and approximations. Manag Sci 32(8):975-981
196. Zipkin P (2000) Foundations of inventory management. McGraw-Hill, NY
197. Aloise D, Desphande A, Hansen P, Popat P (2009) NP-hardness of Euclidean sum-of-squares clustering. Mach Learn 75(2):245-248
198. Aloise D, Hansen P, Liberti L (2010) An improved column generation algorithm for minimum sum of squares clustering. Math Program Ser A, 20 April 2010, published online
199. Beasley JE (1985) A note on solving large p-median problems. Eur J Oper Res, 21(2):270-273
200. Bilgen B, Gunther H-O (2009) Integrated production and distribution planning in the fast moving consumer goods industry: a block planning application. OR Spectrum, 18 June. 2009, first published online
201. Braysy O, Gendreau M (2002) Tabu Search heuristics for the vehicle routing problem with time windows. Top 10(2):211-237
202. Captivo EM (1991) Fast primal and dual heuristics for the p-median location problem. Eur J Oper Res, 52(1):65-74
203. Christou IT (2011) Coordination of cluster ensembles via exact methods. IEEE Trans Pattern Anal Mach Intell 33(2):279-293
204. Christou IT, Lagodimos AG, Lycopoulou D (2007) Hierarchical production planning for multiproduct lines in the beverage industry. J Prod Plan Control 18(5):367-376
205. Cornuejols G, Fisher M, Nemhauser GL (1977) On the uncapacitated location problem. Ann Discret Math, 1:163-177
206. Desrochers M, Soumis F (1988) A reoptimization algorithm for the shortest path problem with time windows. Eur J Oper Res, 35(2):242-254
207. Desrochers M, Soumis F (1989) A column generation approach to the urban transit crew scheduling problem. Trans Sci 23(1):1-13
208. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time-windows. Oper Res 40(2):342-354
209. Desrosiers J, Soumis F, Desrochers M (1984) Routing with time-windows by column generation. Networks, 14(4):545-565
210. Elloumi S, Labbe M, Pochet Y (2004) A new formulation and resolution method for the p-center problem. INFORMS J Comp 16(1):84-94
211. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6):992-1009
212. Ghiani G, Laporte G, Musmanno R (2004) Introduction to logistics systems planning and control. Wiley, Chicester
213. Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res, 150:150-162
214. Golden BL, Assad AA (1988) Vehicle routing: methods and studies. North-Holland, Amsterdam
215. Hansen P, Mladenovic N (1997) Variable neighborhood search for the p-median. Locat Sci 5(4):207-226
216. Hoefer M (2003) Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location. Lect Notes Comput Sci, 2647
217. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems: part 2, the p-medians. SIAM J Appl Math, 37:539-560
218. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouse. Manag Sci, 9(4):643-666
219. Laporte G (1988) Location-routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, Amsterdam
220. Love RF, Morris JG, Wesolowsky GO (1988) Facilities Location. North-Holland, Amsterdam
221. Maranzana FE (1964) On the location of supply points to minimize transportation costs. Operat Res Quart 15:261-270
222. Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13(1):182-196
223. Meyer RR (1992) Lecture notes on integer programming. Dept of Computer Sciences, University of Wisconsin
224. Moreno J, Rodrigez C, Jimenez N (1990) Heuristic cluster algorithm for multiple facility location-allocation problem. RAIRO Oper Res 25(1):97-107
225. Pardalos PM, Pitsoulis LS (2000) Nonlinear assignment problems: algorithms and applications. Kluwer, Dordrecht
226. Resende M G C, Werneck RF (2003) On the implementation of a swap-based local search procedure for the p-median problem. In: Proceedings of the 5th Workshop on algorithm engineering and experiments, pp. 119-127, SIAM
227. Resende M G C, Werneck RF (2004) A hybrid heuristic for the p-median problem. J Heuristics 10(1):59-88
228. Shi L, Meyer RR, Bozbay M, Miller AJ (2004) A nested partitions method for solving large-scale multi-commodity facility location problems. J Syst Sci Syst Eng 13(2):158-179
229. Whitaker R (1983) A fast algorithm for the greedy interchange for large scale clustering and median location problems. INFOR, 21:95-108
230. Wren A (1981) Computer scheduling of public transport urban passenger vehicle and crew scheduling. North-Holland, Amsterdam
231. Yunes TH, Moura AV, deSouza CC (2005) Hybrid column generation approaches for urban transit crew management problems. Transp Sci 39(2):273-288