An evolutionary algorithm for assembly scheduling problems with release times

Ryota Nakatani, Yoshitaka Tanimizu

Research output: Contribution to conferencePaper

Abstract

In recent years, most of products consist of lots of parts in order to satisfy customer demand. Assembly sequence planning becomes more complicated in the product development process than before. A suitable assembly sequence has an effect on the reduction of time and cost in the manufacturing process. This research proposes a new evolutionary algorithm for finding an optimal assembly sequence of products with a large number of parts with deferent release times. The experimental results demonstrate that the new method is superior to the previous method from the viewpoint of the minimization of the make-span.

Original languageEnglish
Publication statusPublished - 2017 Nov 13
Externally publishedYes
Event9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017 - Hiroshima City, Japan
Duration: 2017 Nov 132017 Nov 17

Other

Other9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017
CountryJapan
CityHiroshima City
Period17/11/1317/11/17

Keywords

  • Assembly sequence
  • Crossover
  • Evolutionary algorithm
  • Production schedule

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'An evolutionary algorithm for assembly scheduling problems with release times'. Together they form a unique fingerprint.

  • Cite this

    Nakatani, R., & Tanimizu, Y. (2017). An evolutionary algorithm for assembly scheduling problems with release times. Paper presented at 9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017, Hiroshima City, Japan.