An evolutionary algorithm for assembly scheduling problems with release times

Ryota Nakatani; Yoshitaka Tanimizu

doi:10.1299/jsmelem.2017.9.109

An evolutionary algorithm for assembly scheduling problems with release times

Research output: Contribution to conference › Paper › peer-review

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 language	English
DOIs	https://doi.org/10.1299/jsmelem.2017.9.109
Publication status	Published - 2017 Nov 13
Externally published	Yes
Event	9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017 - Hiroshima City, Japan Duration: 2017 Nov 13 → 2017 Nov 17

Other

Other	9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017
Country/Territory	Japan
City	Hiroshima City
Period	17/11/13 → 17/11/17

Keywords

Assembly sequence
Crossover
Evolutionary algorithm
Production schedule

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

Access to Document

10.1299/jsmelem.2017.9.109

Cite this

@conference{87beffb7f4bb44fe801b0614d9865ec0,

title = "An evolutionary algorithm for assembly scheduling problems with release times",

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.",

keywords = "Assembly sequence, Crossover, Evolutionary algorithm, Production schedule",

author = "Ryota Nakatani and Yoshitaka Tanimizu",

year = "2017",

month = nov,

day = "13",

doi = "10.1299/jsmelem.2017.9.109",

language = "English",

note = "9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017 ; Conference date: 13-11-2017 Through 17-11-2017",

}

TY - CONF

T1 - An evolutionary algorithm for assembly scheduling problems with release times

AU - Nakatani, Ryota

AU - Tanimizu, Yoshitaka

PY - 2017/11/13

Y1 - 2017/11/13

N2 - 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.

AB - 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.

KW - Assembly sequence

KW - Crossover

KW - Evolutionary algorithm

KW - Production schedule

UR - http://www.scopus.com/inward/record.url?scp=85041340692&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85041340692&partnerID=8YFLogxK

U2 - 10.1299/jsmelem.2017.9.109

DO - 10.1299/jsmelem.2017.9.109

M3 - Paper

AN - SCOPUS:85041340692

T2 - 9th International Conference on Leading Edge Manufacturing in 21st Century, LEM 2017

Y2 - 13 November 2017 through 17 November 2017

ER -

An evolutionary algorithm for assembly scheduling problems with release times

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this