Research on job shop scheduling aiming at Instant Customerisation

Author

He, Li ; Liu, Yong-xian ; Xie, Hua-Long ; Zhang, Yu

Author_Institution

Coll. of Mech. Eng., Shenyang Ligong Univ., Shenyang

fYear

2008

fDate

1-3 Sept. 2008

Firstpage

290

Lastpage

294

Abstract

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.

Keywords

job shop scheduling; particle swarm optimisation; instant customerisation; job shop scheduling; particle swarm optimisation; production model; Automation; Helium; Integrated circuit modeling; Job production systems; Job shop scheduling; Machining; Mass production; Mechanical engineering; Optimization methods; Scheduling algorithm; IC; Job shop scheduling; PSO; Production model;

fLanguage

English

Publisher

ieee

Conference_Titel

Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on

Conference_Location

Qingdao

Print_ISBN

978-1-4244-2502-0

Electronic_ISBN

978-1-4244-2503-7

Type

conf

DOI

10.1109/ICAL.2008.4636162

Filename

4636162