中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/83191
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 41949393      Online Users : 914
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/83191


    Title: 以分支定界法求解具批量機台與時間延滯之零工式生產排程問題;A Branch and Bound Algorithm for Job Shop Problem with a Batch Machine and Time-Lags
    Authors: 相虹;Hung, Hsiang
    Contributors: 工業管理研究所
    Keywords: 批量生產;時間延滯;分支定界法;零工式;Batch;Time-Lags;Branch and Bound;Job Shop
    Date: 2020-08-18
    Issue Date: 2020-09-02 15:06:35 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 本研究探討用分支定界法求解零工式生產排程的問題,其環境具有批量生產與時間延遲之限制特性,批量生產為機台上指定之作業可以被批量加工。而等候時間延滯上的限制中,因考量到批量機台的加工,故當作業從前一個工作站離開後,該作業不需要等待最小的時間,可以直接進入下個工作站,但仍需要在一定的時間之內抵達下一個工作站。
    因此時間延滯上的限制需要考慮到當工件抵達機台上可以開始被加工的時間,再加上指定機台具有批量生產之功能,希望藉由批量生產來減少所需的完工時間。為了解決以上研究內容中提出的限制問題,我們將在本研究中發展一分支定界的演算法,並加入批量生產的限制,目標為在此環境下能夠得到最小的完工時間。
    ;The main purpose of this research is to discuss a branch and bound algorithm for job shop problem with a batch machine and time-lags, the environment have the batches and the time lags, batch processing of machine indicated on the workpiece can be batch processing, and waiting time constraints, when after the completion of the artifacts used workstation, over a period of time is needed to enter to the next station for processing, and the workpiece must wait for a certain minimum time, at the same time wait for no more than a certain time.
    Therefore, the waiting time limit needs to take into account the time that each workpiece can start processing. In addition, some limited machines have the capacity of mass production. It is hoped that by batch processing, the required completion time can be reduced. To solve this problem, we will develop a branch and bound algorithm, and the objective is minimize the maximum makespan.
    Appears in Collections:[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML174View/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 ©   - 隱私權政策聲明