English  |  正體中文  |  简体中文  |  Items with full text/Total items : 65317/65317 (100%)
Visitors : 21301824      Online Users : 160
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/76998

    Title: 批量機台具合適度限制及等候時間限制求最小化總完工時間之生產排程問題;The Parallel Batch Machine Scheduling with Machine Eligibility and Waiting Time Constraints to Minimize Total Completion Time
    Authors: 黃逸華;Huang, Yi-Hua
    Contributors: 工業管理研究所
    Keywords: 總完工時間;平行機台;批量加工;等候時間限制;Parallel machine;batching processing;waiting time constraints;total completion time
    Date: 2018-08-22
    Issue Date: 2018-08-31 12:43:53 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 在本研究中,我們研究 n 個可以進行批次加工的工作跟 m 台平行機台的排程問題,這些平行機台的處理時間是不同的,針對不同機台的合適度條件,即是說工作有適合自己加工的機台,在符合的機台環境下,該工作才能加工,另外工作可以集合成批次再進到機台內開始進行加工,我們研究的目標是在找最小化的總完工時間。
    ;In this research, we research the scheduling problem with n jobs that can be divided into batches and m parallel machines under availability constraint. Due to the eligibility constraint, each jobs has its own recipe, not all m machines can process job’s recipe. And the jobs have the waiting time before the processing, they can process together when their arrival time smaller than the batch’s waiting time. The objective of our scheduling problem is to minimize the total completion time.
    In order to find the best solution to this problem, this research proposes a branch and bound algorithm. In the algorithm of this study, first, we resort a sequence according to the job ‘s arrival time. The available batch positions of the machines are branched, and we determine whether schedule the job to process on the batch of the machine, and then how to plan the remaining job entering the same or different batches.
    Appears in Collections:[工業管理研究所 ] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    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  - 隱私權政策聲明