A hybrid heuristic algorithm for the multistage supply chain network problem
暂无分享,去创建一个
[1] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[2] C. Poirier,et al. Advanced Supply Chain Management: How to Build a Sustained Competitive Advantage , 1999 .
[3] M. Gen,et al. Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach , 2002 .
[4] Pierre Hansen,et al. A Plant and Warehouse Location Problem , 1977 .
[5] Hartmut Stadtler,et al. Supply Chain Management and Advanced Planning , 2000 .
[6] M. Todd,et al. The Ellipsoid Method: A Survey , 1980 .
[7] Wei-Chang Yeh. A new branch-and-bound approach for the n/2/flowshop/alphaF+betaCmax flowshop scheduling problem , 1999, Comput. Oper. Res..
[8] M. Rönnqvist,et al. Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem , 1997 .
[9] Michael J. Todd,et al. Feature Article - The Ellipsoid Method: A Survey , 1981, Oper. Res..
[10] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[11] Américo Azevedo,et al. Order planning for networked make-to-order enterprises—a case study , 2000, J. Oper. Res. Soc..
[12] W. Yeh. An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem , 2001 .
[13] Choong Y. Lee,et al. A cross decomposition algorithm for a multiproduct-multitype facility location problem , 1993, Comput. Oper. Res..
[14] Andreas T. Ernst,et al. Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree , 2001, J. Heuristics.
[15] G. Raidl,et al. Prüfer numbers: a poor representation of spanning trees for evolutionary search , 2001 .
[16] Guisseppi A. Forgionne,et al. Corporate Management Science Activities: An Update , 1983 .
[17] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..