An Assembly Scheduling Model for Complex Machine Product

Article Preview

Abstract:

According to the characteristics of assembly scheduling, an assembly scheduling model for complex machine product was defined in this paper. The assembly relationship of a complex machine product is expressed by a job assembly graph. A job assembly graph is translated into an assembly process graph. The assembly process graph is a tree-form. There is a partial order between each child node and its parent in the assembly process graph. Then an assembly scheduling algorithm for complex machine product is given. The goal of the algorithm is minimizing total assembling time. The algorithm could always gain a good assembly schedule through minimizing the waiting time of all assembling operations. The feasibility and efficiency of the algorithm was verified through an example.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

4643-4646

Citation:

Online since:

August 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] M. M. Nasiri and F. Kianfar: International Journal of Advanced Manufacturing Technology, Vol. 58(2012), p.1105.

Google Scholar

[2] E. Atabak, S. Maghsud, T. Seyda and E. Afshin: Computers and Industrial Engineering Vol. 61(2011), p.171.

Google Scholar

[3] A. Udomsakdigool and V. Kachitvichyanukul: International Journal of Production Research, Vol. 46(2008), p.4155.

Google Scholar

[4] L. Anna: Journal of Manufacturing Technology Management Vol. 22(2011), p.748.

Google Scholar

[5] N. Yahyaoui,  F. Fnaiech: IEEE Transactions on Industrial Electronics Vol. 58(2011), p.1052.

Google Scholar

[6] R. Tavakkoli, M. Azarkish and A. Sadeghnejad: Expert Systems with Applications. Vol. 38(2011), p.10812.

Google Scholar

[7] S. H. Niu, S. K. Ong and A. Y. C. Nee: International Journal of Production Research Vol. 50(2012), p.192.

Google Scholar