English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67783/67783 (100%)
Visitors : 23082661      Online Users : 1159
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/54708

    Title: 具最小與最大時間延遲限制之零工式排程問題;Job-Shop Scheduling Problem with Minimum and Maximum Time Lags
    Authors: 林于鉉;Lin,Yu-hsuan
    Contributors: 工業管理研究所
    Keywords: 零工式生產環境。;等候時間窗口;枝界法;job shop problem;minimum and maximum time lags
    Date: 2012-07-19
    Issue Date: 2012-09-11 19:00:03 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 本論文主要在探討具有最大時間區間與最小時間區間限制特性的零工式生產( job-shop)排程問題,此限制類型的問題常見於工業環境中,例如:半導體產業的蝕刻製程,化學產業的鍍鎳製程等等,當一工件從前一工作站完工後,需要等待一段時間才能進入至下一工作站進行加工,該工件都至少必須等待一定的最小時間,同時等待不能超過一定的最大時間,因此最小與最大等候時間區制須要考慮每個工件能開始加工的時間。針對此問題我們將發展一結合 Carlier and Pinson (1989),Sheen and Liao (2007) and Pinedo (2008)提出的演算法,利用開始時間與最大最小完工時間的限制減少需要展開的時間與節點數量,並求得最佳解。We consider the job shop scheduling problem with minimum and maximum time lags while minimizing the makespan. This problem is common in a manufacturing environment where the next job has to be carried out within a specific time range after the completion of the immediately preceding job. Each operation in job shop system must be waiting for the lower bound of waiting time but do not exceed the upper bound of waiting time to perform the next operation. Besides, minimum and maximum time lags constraints on the starting time of each operation are also considered.We describe a branch and bound algorithm, based on the input and output of a clique and relevant propositions, for finding the optimal waiting times. There are n jobs have to be processed on m machines in order to minimize makespan. We incorporate the concept of head and tail which proposed from Carlier and Pinson (1989) and the branch and bound algorithm proposed by Sheen and Liao (2007) to solve the job-shop scheduling with minimum and maximum time lags problem. With the proposed branch and bound algorithm, we can either find an optimal schedule or establish the infeasibility within an acceptable run time.
    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  - 隱私權政策聲明