A hybrid heuristic algorithm for the multistage supply chain network problem

International Journal of Advanced Manufacturing Technology

Volumn 26, Issue 5-6, 2005, Pages 675-685

  Yeh, Wei Chang ^a  

^a NATIONAL CHIAYI UNIVERSITY   (Taiwan)

Author keywords

Greedy method; Heuristic algorithm; Linear programming technique; Multistage supply chain network

Indexed keywords

ALGORITHMS; COSTS; ERROR ANALYSIS; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION;

GREEDY METHOD; HEURISTIC ALGORITHM; LINEAR PROGRAMMING TECHNIQUE; MULTISTAGE SUPPLY CHAIN NETWORK;

INDUSTRIAL MANAGEMENT;

EID: 24144468626     PISSN: 02683768     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00170-003-2025-z     Document Type: Article

References (20)

1. Syarif A, Yun YS, Gen M (2002) Study on multi-stage logistic chain network: a spanning tree-based genetic algorithm approach. Comput Ind Eng 43:299-314
2. Chopra S, Meindl P (2003) Supply chain management: strategy, planning and operation, 2nd edn. Prentice-Hall, New Jersey
3. Stadtler H. Kilger C (eds) (2002) Supply chain management and advanced planning. Springer, Berlin Heidelberg New York
4. Poirier CC (1999) Advanced supply chain management: how to build a sustained competitive advantage. Berrett-Kochler, San Francisco, CA
5. Forgionne GA (1983) Corporate management science activities: an update. Interfaces 13(3):20-23
6. Tragantalerngsak S, Holt J, Ronnqvist M (1998) Lagrangian heuristics for the two-echelon, single-source, capacitate location problem. Eur J Oper Res 102:611-625
7. Azevedo L, Sousa JP (2000) Order planning for networked make-to-order enterprises - a case study. J Oper Res Soc 51:1116-1127
8. Kaufman L, Eede MV, Hansen P (2000) A plant and warehouse location problem. Oper Res Q 28:547-554
9. Lee CY (1993) A cross decomposition algorithm for a multi-product multi-type facility location problem. Comput Oper Res 20:527-540
10. Yu H (1997) ILOG in the supply chain. ILOG technical report
11. Gen M, Cheng R (1997) Genetic algorithm and engineering design. Wiley, New York
12. Yeh WC (2001) An efficient branch-and-bound algorithm for the two-machine bicriteria flowshop scheduling problem. J Manuf Syst 20(2):113-123
13. max flowshop scheduling problem. Comput Oper Res 26(13):1293-1310
14. Gottlieb J, Julstrom BA, Raidl GR, Rothlauf F (2001) Prufer numbers: a poor representation of spanning trees for evolutionary search. SAP Proceedings of the Genetic and Evolutionary Computation Conference, San Francisco, CA, pp 343-350
15. Krishnamoorthy M, Ernst AT, Sharaiha YM (1999) Comparison of algorithms for the degree constrained minimum spanning tree. Technical report, CSIRO Mathematical and Information Sciences. Clayton, Australia
16. Bazaraa MS, Jarvis JJ (1990) Linear programming and network flows, 2nd edn. Wiley, New York
17. Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton, NJ
18. Bland RG, Goldfarb D, Todd MJ (1981) The ellipsoid method: a survey. Oper Res 29:1039-1091
19. Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373-395
20. Yeh WC (2000) A memetic algorithm for the min k-cut problem. Control Intell Syst 28(2):47-55