Set-Up Coordination between Two Stages of a Supply Chain

作者: A. Agnetis , P. Detti , C. Meloni , D. Pacciarelli

DOI: 10.1023/A:1014934612090

关键词:

摘要: In the material flow of a plant, parts are processed in batches, each having two distinct attributes, say shape and color. one department, set-up occurs every time new batch is different from previous one. downstream there when color Since unique sequence batches must be established, problem consists finding such common optimizing an overall utility index. Here we consider indices, namely total number set-ups maximum between departments. Both problems shown to NP-hard. An efficient heuristic approach presented for first index which allows solve set real-life instances performs satisfactorily on large sample experimental data.

参考文章(8)
Douglas J. Thomas, Paul M. Griffin, Coordinated supply chain management European Journal of Operational Research. ,vol. 94, pp. 1- 15 ,(1996) , 10.1016/0377-2217(96)00098-7
Frank Harary, C. St. J. A. Nash-Williams, On eulerian and hamiltonian graphs and line graphs Canadian Mathematical Bulletin. ,vol. 8, pp. 701- 709 ,(1965) , 10.4153/CMB-1965-051-3
Arundhati Raychaudhuri, The total interval number of a tree and the Hamiltonian completion number of its line graph Information Processing Letters. ,vol. 56, pp. 299- 306 ,(1995) , 10.1016/0020-0190(95)00163-8
F. Hadlock, Finding a Maximum Cut of a Planar Graph in Polynomial Time SIAM Journal on Computing. ,vol. 4, pp. 221- 225 ,(1975) , 10.1137/0204019
Alan A. Bertossi, The edge Hamiltonian path problem is NP-complete Information Processing Letters. ,vol. 13, pp. 157- 159 ,(1981) , 10.1016/0020-0190(81)90048-X
M. R. Garey, D. S. Johnson, R. Endre Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete SIAM Journal on Computing. ,vol. 5, pp. 704- 714 ,(1976) , 10.1137/0205049
H. J. Veldman, A result on Hamiltonian line graphs involving restrictions on induced subgraphs Journal of Graph Theory. ,vol. 12, pp. 413- 420 ,(1988) , 10.1002/JGT.3190120312
Frank Harary, Graph theory ,(1969)