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

Zhihong Cheng, Guangzhu Chen, Badurdeen Fazleena, Ding Gao

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2010 International Conference on Computer Design and Applications, ICCDA 2010
PagesV2221-V2223
DOIs
StatePublished - 2010
Event2010 International Conference on Computer Design and Applications, ICCDA 2010 - Qinhuangdao, Hebei, China
Duration: Jun 25 2010Jun 27 2010

Publication series

Name2010 International Conference on Computer Design and Applications, ICCDA 2010
Volume2

Conference

Conference2010 International Conference on Computer Design and Applications, ICCDA 2010
Country/TerritoryChina
CityQinhuangdao, Hebei
Period6/25/106/27/10

Keywords

  • Capacitated constraint
  • Immune complement
  • Lot sizing
  • Production planning

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'Scheduling optimization of capacitated lot sizing problem based on immune complement algorithm'. Together they form a unique fingerprint.

Cite this