Printing Scheduling Using Peter Rof-Hamm Algorithm

Article Preview

Abstract:

The minimum whole production time is a very effective tool to improve production efficiency in the printing company. Printing scheduling is a key to achieve this goal. In this paper, we use Peter Rof-Hamm algorithm to determine better printing scheduling quickly with the minimum whole production time. Performance of the proposed method is compared with rule-based heuristic algorithm. This proposed algorithm is very simple, and it can get near-optimum printing scheduling quickly, which makes it more useful in the printing scheduling.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

702-707

Citation:

Online since:

October 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Z. H. Fu and H. Shen: Journal of Xi'an Institute of Technology, Vol. 24 (2004) No.2, pp.155-159. (In Chinese)

Google Scholar

[2] H. Wu, Y. S. Wang, G. C. Chen and H. Q. Chen: Modern Computer, Vol.24 (2010) No.7, pp.9-12. (In Chinese)

Google Scholar

[3] Q. L. Wang and J. Wang: Journal of Xi'an Aerotechnical College, Vol. 25 (2007) No. 1, pp.67-68. (In Chinese)

Google Scholar

[4] J. Wang and Q. L. Wang: Journal of Shanxi University of Technology, Vol. 22 (2006) No. 2, pp.39-41. (In Chinese)

Google Scholar

[5] H. M. Xu: Journal of Hangzhou Dianzi University, Vol. 29 (2009) No. 6, pp.74-77. (In Chinese)

Google Scholar

[6] Y. R. Li: Packaging Engineering, Vol.32 (2011) No.13, pp.99-101. (In Chinese)

Google Scholar

[7] X. Y. Han, H. L. Wang and J. Y. Yan: Drive System Technology, Vol. 22 (2008) No. 4, pp.32-35. (In Chinese)

Google Scholar

[8] Y. L. Wang and Z. L. Chen: Journal of Soochow University ( Engineering Science Edition), Vol. 31 (2011) No. 4, pp.43-47. (In Chinese)

Google Scholar