ASIA unversity:Item 310904400/18275
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 92958/108462 (86%)
造訪人次 : 20419898      線上人數 : 260
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    ASIA unversity > 管理學院 > 會計與資訊學系 > 期刊論文 >  Item 310904400/18275


    請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/18275


    題名: An Algorithm for Optimizing Joint Products Decision Based on the Theory of Constraints
    作者: 賴建文;Lai, Chien-Wen
    貢獻者: 會計與資訊學系
    關鍵詞: Theory of constraints;Algorithm;Joint products;Product mix decision
    日期: 2007-12
    上傳時間: 2012-11-26 12:34:23 (UTC+8)
    摘要: A particular decision-making process that is needed by most firms who produce joint products is the one requiring an assessment of desirability of further processing joint products beyond the split-off point. The purpose of this paper is to develop an algorithm for optimizing a joint products further processing decision under the theory of constraints. To fit the jointly produced characteristic of joint products and the sequential produced characteristic between each joint product and its further processing product, the algorithm is composed of seven steps. These steps consider every bottleneck resource to the decision-making process by computing a priority ratio to establish its priority sequence. According to the priority sequence of the most constrained resource, the initial master production schedule is developed. Then, the following steps find the best path to reach the optimal solution under the guidance of all bottleneck resources. Due to its accessibility and comprehensibility, the TOC-based algorithm developed by this paper is a practical tool for obtaining the optimal joint products further processing decision.
    關聯: INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
    顯示於類別:[會計與資訊學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML700檢視/開啟


    在ASIAIR中所有的資料項目都受到原著作權保護.


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