Cellular Automata Variation Particle Swarm Optimization Algorithm for Batch Scheduling

Author

Zeng Min ; Long Qiao-yun ; Liu Qiong-mei

Author_Institution

Sch. of Comput. & Commun., Hunan Univ. of Technol., Zhuzhou, China

fYear

2012

Firstpage

193

Lastpage

196

Abstract

The article in order to solve Panel Furniture business of mass customization´s batch scheduling, by analyzing production processes, the article proposes parallel machine serial-batching scheduling, in reaction to the problems of flexible production lines batch scheduling. The design is an adaptive Cellular Automat variation Particle Swarm optimization algorithm, which, when used for the single objective test, is better than the current records (For comparison, 30% of the probability finds the optimal solution, using parallel machine scheduling with standard 30 set of data).

Keywords

cellular automata; furniture industry; mass production; particle swarm optimisation; product customisation; scheduling; adaptive cellular automata variation particle swarm optimization algorithm; flexible production line batch scheduling; mass customization batch scheduling; panel furniture business; parallel machine serial-batching scheduling; production process analysis; Arrays; Automata; Batch production systems; Job shop scheduling; Optimization; Particle swarm optimization; Batch production scheduling; Mass Customization (MC); Particle Swarm Optimization; cellular automaton;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent System Design and Engineering Application (ISDEA), 2012 Second International Conference on

Conference_Location

Sanya, Hainan

Print_ISBN

978-1-4577-2120-5

Type

conf

DOI

10.1109/ISdea.2012.699

Filename

6173181