Research on job shop scheduling aiming at Instant Customerisation

The characteristic of instant customerization (IC) production model and its job-shop scheduling problem is described. Considering the conventional algorithmspsila low efficiency of search especially global search, PSO-based to job shop scheduling problem of IC is presented. According to the characteristics of the problem, the PSO coding and optimization are studied to determine the way of coding and operation, which is more adaptable to job shop scheduling. The job shop scheduling part of the system is then programmed with the algorithm. Simulation results show that setting the suitable parameters can provide an suitable working sequence to adapt to the IC job-shop problem. At last, a suggestion about this problem is presented.