Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. Solving a multi-objective master planning problem with substitution and a recycling process for a capacitated multi-commodity supply chain network
 
  • Details

Solving a multi-objective master planning problem with substitution and a recycling process for a capacitated multi-commodity supply chain network

Journal
Journal of Intelligent Manufacturing
Journal Volume
25
Journal Issue
1
Pages
1-25
Date Issued
2014-02-01
Author(s)
Lei, Seak Tou
CHING-CHIN CHERN  
KWEI-LONG HUANG  
DOI
https://api.elsevier.com/content/abstract/scopus_id/84897665074
10.1007/s10845-012-0667-0
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/425353
URL
https://api.elsevier.com/content/abstract/scopus_id/84897665074
Abstract
This study focuses on solving the multi-objective master planning problem for supply chains by considering product structures with multiple final products using substitutions, common components, and recycled components. This study considers five objectives in the planning process: (1) minimizing the delay cost, (2) minimizing the substitution priority, (3) minimizing the recycling penalty, (4) minimizing the substitution cost, and (5) minimizing the cost of production, processing, inventory holding and transportation. This study proposes a heuristic algorithm, called the GA-based Master Planning Algorithm (GAMPA), to solve the supply-chain master planning problem efficiently and effectively. GAMPA first transforms the closed-loop supply chain into an open-loop supply chain that plans and searches the sub-networks for each final product. GAMPA then uses a genetic algorithm to sort and sequence the demands. GAMPA selects the chromosome that generates the best planning result according to the priority of the objectives. GAMPA plans each demand sequentially according to the selected chromosome and a randomly-selected production tree. GAMPA tries different production trees for each demand and selects the best planning result at the end. To show the effectiveness and efficiency of GAMPA, a prototype was constructed and tested using complexity analysis and computational analysis to demonstrate the power of GAMPA. © 2012 Springer Science+Business Media, LLC.
Subjects
Advanced planning and scheduling | Heuristic algorithm | Master planning | Multiple-goal optimization | Recycle process | Recycling penalty | Substitutions | Supply chain management
Publisher
SPRINGER
Type
journal article

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science