An evolutionary algorithm for assembly job shop with part sharing

Felix T.S. Chan, T. C. Wong, L. Y. Chan

    Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

    29 Citations (Scopus)

    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. © 2008 Elsevier Ltd. All rights reserved.
    Original languageEnglish
    Pages (from-to)641-651
    JournalComputers and Industrial Engineering
    Volume57
    Issue number3
    DOIs
    Publication statusPublished - Oct 2009

    Research Keywords

    • Assembly job shop
    • Dispatching rules
    • Genetic algorithm
    • Lot streaming
    • Part sharing

    Fingerprint

    Dive into the research topics of 'An evolutionary algorithm for assembly job shop with part sharing'. Together they form a unique fingerprint.

    Cite this