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


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


    题名: A New Bidirectional Heuristic for Assembly Line Balancing Problem
    作者: 高秀學;Kao, Hsiu-hsueh;Yeh, Din-horng
    贡献者: 淡江大學企業管理學系
    日期: 2009-11
    上传时间: 2011-08-23 01:06:28 (UTC+8)
    出版者: Elsevier
    摘要: Assembly line balancing problem (ALBP) is one of the well-known NP-hard layout planning problems for mass production systems. Many exact solution approaches have been developed, including 0–1 integer programming model, branch and bound algorithm, dynamic programming model, etc.; however, all optimal approaches are computationally inefficient in solving large-scale problems, which makes heuristic approaches a necessity in practice. In this paper we propose a new efficient heuristic, based on a recent bidirectional approach and the famous critical path method (CPM) widely used in project management, to resolve the issue of task assignment for ALBP. An example is given for illustration, and numerical results of sample problems selected from the literature are also given to show the effectiveness of the proposed heuristic.
    關聯: Computers & Industrial Engineering Journal 57(4), pp.1155-1160
    DOI: 10.1016/j.cie.2009.05.004
    显示于类别:[企業管理學系暨研究所] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    A New Bidirectional Heuristic for Assembly Line Balancing Problem.pdf231KbAdobe PDF0检视/开启
    index.html0KbHTML491检视/开启

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

    TAIR相关文章

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