English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51296/86402 (59%)
造訪人次 : 8161764      線上人數 : 59
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/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 PDF145檢視/開啟



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