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

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Kai Cheng, Yongxian Liu, Xipeng Xu and Hualong Xie

Pages:

1324-1328

DOI:

10.4028/www.scientific.net/AMM.16-19.1324

Citation:

L. He et al., "Job Shop Scheduling Problem Based on Requirement Forecasting Aiming at Instant Customerization", Applied Mechanics and Materials, Vols. 16-19, pp. 1324-1328, 2009

Online since:

October 2009

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.