English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69937/69937 (100%)
Visitors : 23373143      Online Users : 571
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/84492


    Title: 具機台合適度決定與時間窗口限制之平行批次處理問題;Parallel Batch Processing Problem with Machine Eligibility Determination and Time Window Constraint
    Authors: 沈國基
    Contributors: 工業管理研究所
    Keywords: 平行批次處理;時間窗口限制;機台合適度決定;混合整數規劃;以分解法為基礎的啟發式解法;Parallel batch processing;Time window constraint;Machine eligibility determination;Mixed-integer programming;Decomposition-based heuristic
    Date: 2020-12-08
    Issue Date: 2020-12-09 09:27:47 (UTC+8)
    Publisher: 科技部
    Abstract: 本提案書將探討平行批次處理問題。研究議題來自於半導體生產的實際條件要求,每一工件有特定配方的需求且具有不同的晶圓數量,同一批次處理可以同時處理數工件的晶圓,但批次有總上下限晶圓數量的限制;工件發放至平行機台後的某一段時間內必須進行處理,否則將成為瑕疵品;機台因為化學藥劑的使用不同,且化學藥劑於期間內耗用完後,會另外安裝不同藥劑,所以同一機台在不同期間有不同機台合適度的現象。本研究將以極小化Makespan為目標。我們首先將提出一混合整數規劃模型,以求取其最佳解。但因爲研究問題為NP Hard且因應實務上須能解決大的問題,本研究亦將發展以分解法為基礎的啟發式解法,這發展方向也常見於有工件家族(Job family)要求的批次處理問題。本研究最後將評估啟發式解法之求解運算時間(Computational time)與答案品質(Solution quality)。 ;In this proposal, we consider a parallel batch processing problem when minimizing the makespan under constraints of arbitrary lot sizes, machine eligibility, time window, and incompatible job families. Different than the previous researches, the machine’s eligibility in our study is not known in advance and will be determined later after the set of materials is assigned to machines. To the best of our knowledge, there is no published papers which deal with the problem. We will formulate a mixed-integer programming model for solving the problem optimally. However, due to the NP-Hardness of our problem, decomposition approach has been successfully applied to solve a variety of batching problems, especially with incompatible job families. Here in this proposal, we will also propose a decomposition-based heuristic algorithm to obtain a near-optimal solution for large-scale instances when the computation time is a concern.
    Relation: 財團法人國家實驗研究院科技政策研究與資訊中心
    Appears in Collections:[工業管理研究所 ] 研究計畫

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML32View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 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 ©   - Feedback  - 隱私權政策聲明