中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/51706
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 78936/78937 (100%)
造访人次 : 39792704      在线人数 : 623
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/51706


    题名: Incorporating a database approach into the large-scale multi-level lot sizing problem
    作者: Chang,DS;Chyr,FC;Yang,FC
    贡献者: 企業管理學系
    关键词: SIZE MODEL;PRODUCT STRUCTURES;PRODUCTION SYSTEM;INVENTORY;HEURISTICS;ALGORITHMS
    日期: 2010
    上传时间: 2012-03-27 19:03:17 (UTC+8)
    出版者: 國立中央大學
    摘要: Traditionally, optimization for large-scale multi-level lot sizing (MLLS) problems always encountered heavy computational burden. Scholars also indicated that "whatever the optimal method chosen to solve the MLLS problem, standard optimization packages were still faced with computer memory constraints and computational limits that prevented them from solving realistic size cases". Therefore, the main purpose of this paper is to propose an optimal method to reduce the computer memory while solving the large-scale MLLS problems. The optimal method is designed to implement on a database entirely because the demand for computer memory can be reduced significantly by means of the utilization of database storage. An example is given to illustrate the proposed method and computation capability is tested for the MLLS problems with up to 1000 levels and 12 periods. (C) 2010 Elsevier Ltd. All rights reserved.
    關聯: COMPUTERS & MATHEMATICS WITH APPLICATIONS
    显示于类别:[企業管理學系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML415检视/开启


    在NCUIR中所有的数据项都受到原著作权保护.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明