Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/31084
Title: An evolutionary algorithm for assembly job shop with part sharing
Authors: Chan, FTS 
Wong, TC
Chan, LY
Keywords: Assembly job shop
Dispatching rules
Genetic algorithm
Lot streaming
Part sharing
Issue Date: 2009
Publisher: Pergamon Press
Source: Computers and industrial engineering, 2009, v. 57, no. 3, p. 641-651 How to cite?
Journal: Computers and industrial engineering 
Abstract: Assembly job shop problem (AJSP) is an extension of classical job shop problem (JSP). AJSP first starts with a JSP and appends an assembly stage after job completion. Lot Streaming (LS) technique is defined as the process of splitting lots into sub-lots such that successive operation can be overlapped. In this paper, the previous study of LS to AJSP is extended by allowing part sharing among distinct products. In addition to the use of simple dispatching rules (SDRs), an evolutionary approach with genetic algorithm (GA) is proposed to solve the research problem. A number of test problems were conducted to examine the performance of the proposed algorithm. Computational results suggested that the proposed algorithm can outperform the previous one, and can work well with respect to the objective function. Also, the inherent conflicting relationship between the primary objective and the system measurements can be addressed.
URI: http://hdl.handle.net/10397/31084
ISSN: 0360-8352
EISSN: 1879-0550
DOI: 10.1016/j.cie.2008.11.017
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
0
Citations as of Oct 9, 2017

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
Citations as of Oct 16, 2017

Page view(s)

40
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.