English  |  正體中文  |  简体中文  |  Items with full text/Total items : 56831/90534 (63%)
Visitors : 12280822      Online Users : 67
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/55560

    Title: An Optimal Algorithm for TYPE-I Assembly Line Balancing Problem with Resource Constraint
    Authors: Kao, Hsiu-hsueh;Yeh, Din-horng;Wang, Yi-hsien;Hung, Jui-cheng
    Contributors: 淡江大學企業管理學系
    Keywords: Layout;Line balancing;Resource constraint;Shortest route
    Date: 2010-08
    Issue Date: 2013-06-13 11:27:39 (UTC+8)
    Publisher: Lagos: Academic Journals
    Abstract: In this paper we consider resource-constrained type-I assembly line balancing problem (RCALBP-I) in
    which resource of different types, such as machines and workers, are required in processing tasks. The
    objective of RCALBP-I is to minimize not only the number of workstations needed, but also the number
    of resource types required. A shortest route algorithm is proposed to find the optimal solution for
    RCALBP-I. An illustrative example is also given to show the effectiveness of the proposed algorithm.
    Relation: African Journal of Business Management 4(10), pp.2051-2058
    Appears in Collections:[Graduate Institute & Department of Business Administration] Journal Article

    Files in This Item:

    File Description SizeFormat
    1993-8233_4(10)p2051-2058.pdf101KbAdobe PDF163View/Open
    An Optimal Algorithm for TYPE-I Assembly Line Balancing Problem with Resource Constraint.pdf101KbAdobe PDF0View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback