Merging Algorithm for Multi-Varieties and Small-Batch Orders in Iron and Steel Enterprise-Reference-Cited by-同舟云学术

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

Published:2014-06 Issue: Volume:945-949 Page:3092-3096
ISSN:1662-8985
Container-title:Advanced Materials Research
language:
Short-container-title:AMR

Author:

Dong Guang Jing¹,Li Li²,Wu Xiu Ting¹,Su Jun³

Affiliation:

1. University of Science and Technology Beijing

2. Beijing Hyundai Motor Co. LTD

3. Nanjing University

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.

Publisher

Trans Tech Publications, Ltd.

Subject

General Engineering

Link

https://www.scientific.net/AMR.945-949.3092.pdf

Reference5 articles.

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.

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

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.

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.

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.