English  |  正體中文  |  简体中文  |  Items with full text/Total items : 73032/73032 (100%)
Visitors : 23368423      Online Users : 496
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/64930

    Title: 兩階段平行機台考慮工件可分割特性下求解最小完工時間;Two Stage Hybrid Flow Shop Scheduling with Job Splitting Property for Minimizing the Maximum Completion Time
    Authors: 黃少緯;Huang,Shao-wei
    Contributors: 工業管理研究所
    Keywords: 排程;分支界限法;多階段平行機台;工件可分割特性;Scheduling;Branch-and-bound algorithm;Hybrid flow shop;Job-splitting property
    Date: 2014-07-28
    Issue Date: 2014-10-15 14:34:21 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 本論文我們研究一多階段平行機台環境下,有多個工件需要被進行加工處理,且每個工件具有可分割特性的排程問題,我們的目標是決定一最佳排程使得所有工件完工時間最小化。在過去大部分的排程問題都假設每個工件最多只能在一台機台上進行處理,然而在實務上經常會遇到一些情況是多個不同種類的產品,又有各自不同的數量需要在一條生產線上進行加工,在這種狀況下為了使完工時間能夠縮短,我們不會受限於原先的排程假設,我們將允許將相同工件分為多個的批量在不同的機台上同時進行加工,如此來避免機台有閒置的狀況發生。

    ;In this research, we consider the problem of scheduling n jobs on hybrid flow shop with job splitting property, and our objective is to minimize the maximum completion time. In the past, the majority of scheduling studies assumed that each job can be processed on at most one machine at a time. In the real word, there are many cases that have different types of products and each type of products have numbers of units need to go through a production line. In order to make these products finished as soon as possible, it is normal to schedule each unit of the same product on different machines at the same time.

    In this research, we assume that there are two identical parallel machines in the first stage and a single machine in second stage, and the setup time of each job are independent. We use a branch and bound algorithm to find the optimal solution for this problem. In this algorithm, we propose the lower bound and upper bound for this scheduling problem and we use some dominance rules to eliminate unnecessary nodes to improve the efficiency of our algorithm. Finally, we implement this algorithm by JAVA, and we conduct the computational analysis.
    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  - 隱私權政策聲明