Job Shop Scheduling Problem Based on Requirement Forecasting Aiming at Instant Customerization

Article Preview

Abstract:

The characteristic of Instant Customerization (IC) and its job-shop scheduling problem is described. The customer requirements were divided into static forecasting and dynamic forecasting aiming at IC, that is common requirement forecasting and individualized requirement forecasting. According to the characteristics of the problem, the job shop scheduling part of the system is then programmed with an algorithm, PSO. Simulation results showed that requirement forecasting can provide an excellent delivery date to adapt to the IC job-shop problem.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1324-1328

Citation:

Online since:

October 2009

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2009 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] X.H. Xu and S.H. Ma: Journal of Wuhan University of Technology (Transportation Science & Engineering), Vol. 24 (2000) No. 4, pp.32-36. (In Chinese).

Google Scholar

[2] X.H. Xu: Research on some Production and Inventory Problems in Instant Customerization (Ph.D., Huazhong University of Science and Technology, China 2005), pp.11-13. (In Chinese).

Google Scholar

[3] Z.J. Tang: A Study of Manufacturing Model Aiming at Instant Customerisation (Ph.D., Huazhong University of Science and Technology, China 2005), pp.28-32. (In Chinese).

Google Scholar

[4] P. Brucker, S. Heitmann, J. Hurink and et al.: Job-shop Scheduling with Limited Capacity Buffers, OR Spectrum 28, 2006, pp.151-176.

DOI: 10.1007/s00291-005-0008-1

Google Scholar

[5] L. He: Research on Instant Customerization and Its Job Shop Scheduling Problem (Ph.D., Northeastern University, China 2008), pp.63-69. (In Chinese).

Google Scholar