Merging Algorithm for Multi-Varieties and Small-Batch Orders in Iron and Steel Enterprise

Article Preview

Abstract:

Problem of merging multi-attribute, small-batch orders is studied in this paper. A merge algorithm based on clustering is proposed to solve the problem. We mainly use the method of principal component analysis and K-means clustering technology in the algorithm and then merge the orders with similar attributes into production bathes. Finally we verify the algorithm through actual order data and the results show that the algorithm can merge the customer orders efficiently. The algorithm has a great guiding significance.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 945-949)

Pages:

3092-3096

Citation:

Online since:

June 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] H. M M, C. M Y, Y L. Improved particle swarm optimization algorithm for dynamic lot-sizing problem [J]. Computer Integrated Manufacturing System, Vol. 12 (2006), p.1417.

Google Scholar

[2] H. C H, S. Y C. Order Consolidation for Batch Processing [J]. Journal of Combinatorial Optimization, Vol. 9 (2005) , p.121.

Google Scholar

[3] T Z, H. G Q. Headquarters-centered Common Sourcing Management: Order Coordination and Order Consolidation[C]. IEEE Int'l Technology Management Conference, 2011, p.752.

DOI: 10.1109/itmc.2011.5996053

Google Scholar

[4] H. L Z, X. L W. Efficient algorithm for a special case of order consolidation [J]. Journal of Shandong University, Vol. 40(2005), p.31.

Google Scholar

[5] J. P Y, X. B L,Y. H W. Order-grouping quality design method for steel product based on multi-constrain clustering[J] Computer Integrated Manufacturing System, Vol. 15(2009), p.2104.

Google Scholar