Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm

Zhihong Cheng; Guangzhu Chen; Badurdeen Fazleena; Ding Gao

doi:10.1109/ICCDA.2010.5541221

Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm

Zhihong Cheng
, Guangzhu Chen
, Badurdeen Fazleena
, Ding Gao

Producción científica: Conference contribution › revisión exhaustiva

Resumen

There are significant amount of literature on the capacitated lot sizing problem(CLSP) with different levels and approaches. In this article, immune complement algorithm (ICA) was discussed in scheduling optimization of CLSP under the condition of single level, single machine. The affinity function was the total cost which including order , inventory carrying and labor costs. Complement individual was represented by binary to determine order sequence and lot sizing. Experimentation performed with 5 production 6 period indicated that ICA had the characteristics of high speed of convergence, less generations besides approaching best solution, and it could be used in CLSP on medium scale.

Idioma original	English
Título de la publicación alojada	2010 International Conference on Computer Design and Applications, ICCDA 2010
Páginas	V2221-V2223
DOI	https://doi.org/10.1109/ICCDA.2010.5541221
Estado	Published - 2010
Evento	2010 International Conference on Computer Design and Applications, ICCDA 2010 - Qinhuangdao, Hebei, China Duración: jun 25 2010 → jun 27 2010

Serie de la publicación

Nombre	2010 International Conference on Computer Design and Applications, ICCDA 2010
Volumen	2

Conference

Conference	2010 International Conference on Computer Design and Applications, ICCDA 2010
País/Territorio	China
Ciudad	Qinhuangdao, Hebei
Período	6/25/10 → 6/27/10

ASJC Scopus subject areas

Computer Graphics and Computer-Aided Design
Computer Science Applications

Acceder al documento

10.1109/ICCDA.2010.5541221

Otros archivos y enlaces

Citar esto

Cheng, Z., Chen, G., Fazleena, B., & Gao, D. (2010). Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm. En 2010 International Conference on Computer Design and Applications, ICCDA 2010 (pp. V2221-V2223). Artículo 5541221 (2010 International Conference on Computer Design and Applications, ICCDA 2010; Vol. 2). https://doi.org/10.1109/ICCDA.2010.5541221

@inproceedings{3fa1deba6096420fa845295fe9fc3830,

title = "Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm",

abstract = "There are significant amount of literature on the capacitated lot sizing problem(CLSP) with different levels and approaches. In this article, immune complement algorithm (ICA) was discussed in scheduling optimization of CLSP under the condition of single level, single machine. The affinity function was the total cost which including order , inventory carrying and labor costs. Complement individual was represented by binary to determine order sequence and lot sizing. Experimentation performed with 5 production 6 period indicated that ICA had the characteristics of high speed of convergence, less generations besides approaching best solution, and it could be used in CLSP on medium scale.",

keywords = "Capacitated constraint, Immune complement, Lot sizing, Production planning",

author = "Zhihong Cheng and Guangzhu Chen and Badurdeen Fazleena and Ding Gao",

year = "2010",

doi = "10.1109/ICCDA.2010.5541221",

language = "English",

isbn = "9781424471638",

series = "2010 International Conference on Computer Design and Applications, ICCDA 2010",

pages = "V2221--V2223",

booktitle = "2010 International Conference on Computer Design and Applications, ICCDA 2010",

note = "2010 International Conference on Computer Design and Applications, ICCDA 2010 ; Conference date: 25-06-2010 Through 27-06-2010",

}

Cheng, Z, Chen, G, Fazleena, B & Gao, D 2010, Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm. En 2010 International Conference on Computer Design and Applications, ICCDA 2010., 5541221, 2010 International Conference on Computer Design and Applications, ICCDA 2010, vol. 2, pp. V2221-V2223, 2010 International Conference on Computer Design and Applications, ICCDA 2010, Qinhuangdao, Hebei, China, 6/25/10. https://doi.org/10.1109/ICCDA.2010.5541221

Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm. / Cheng, Zhihong; Chen, Guangzhu; Fazleena, Badurdeen et al.
2010 International Conference on Computer Design and Applications, ICCDA 2010. 2010. p. V2221-V2223 5541221 (2010 International Conference on Computer Design and Applications, ICCDA 2010; Vol. 2).

Producción científica: Conference contribution › revisión exhaustiva

TY - GEN

T1 - Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm

AU - Cheng, Zhihong

AU - Chen, Guangzhu

AU - Fazleena, Badurdeen

AU - Gao, Ding

PY - 2010

Y1 - 2010

N2 - There are significant amount of literature on the capacitated lot sizing problem(CLSP) with different levels and approaches. In this article, immune complement algorithm (ICA) was discussed in scheduling optimization of CLSP under the condition of single level, single machine. The affinity function was the total cost which including order , inventory carrying and labor costs. Complement individual was represented by binary to determine order sequence and lot sizing. Experimentation performed with 5 production 6 period indicated that ICA had the characteristics of high speed of convergence, less generations besides approaching best solution, and it could be used in CLSP on medium scale.

AB - There are significant amount of literature on the capacitated lot sizing problem(CLSP) with different levels and approaches. In this article, immune complement algorithm (ICA) was discussed in scheduling optimization of CLSP under the condition of single level, single machine. The affinity function was the total cost which including order , inventory carrying and labor costs. Complement individual was represented by binary to determine order sequence and lot sizing. Experimentation performed with 5 production 6 period indicated that ICA had the characteristics of high speed of convergence, less generations besides approaching best solution, and it could be used in CLSP on medium scale.

KW - Capacitated constraint

KW - Immune complement

KW - Lot sizing

KW - Production planning

UR - https://www.scopus.com/pages/publications/77955871113

UR - https://www.scopus.com/pages/publications/77955871113#tab=citedBy

U2 - 10.1109/ICCDA.2010.5541221

DO - 10.1109/ICCDA.2010.5541221

M3 - Conference contribution

AN - SCOPUS:77955871113

SN - 9781424471638

T3 - 2010 International Conference on Computer Design and Applications, ICCDA 2010

SP - V2221-V2223

BT - 2010 International Conference on Computer Design and Applications, ICCDA 2010

T2 - 2010 International Conference on Computer Design and Applications, ICCDA 2010

Y2 - 25 June 2010 through 27 June 2010

ER -

Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm

Resumen

Serie de la publicación

Conference

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto