淡江大學機構典藏:Item 987654321/55560
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3909709      在线人数 : 361
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/55560


    题名: An Optimal Algorithm for TYPE-I Assembly Line Balancing Problem with Resource Constraint
    作者: Kao, Hsiu-hsueh;Yeh, Din-horng;Wang, Yi-hsien;Hung, Jui-cheng
    贡献者: 淡江大學企業管理學系
    关键词: Layout;Line balancing;Resource constraint;Shortest route
    日期: 2010-08
    上传时间: 2013-06-13 11:27:39 (UTC+8)
    出版者: Lagos: Academic Journals
    摘要: 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.
    關聯: African Journal of Business Management 4(10), pp.2051-2058
    显示于类别:[企業管理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    1993-8233_4(10)p2051-2058.pdf101KbAdobe PDF164检视/开启
    An Optimal Algorithm for TYPE-I Assembly Line Balancing Problem with Resource Constraint.pdf101KbAdobe PDF1检视/开启
    index.html0KbHTML122检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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