平行機台具有彈性維護週期與接續完工限制 求極小化總完工時間排程問題;Parallel Machine Scheduling with Flexible Maintenance and Resumable Jobs for Minimizing Total Completion Time

NCUIR > School of Management at National Central University > Graduate Institute of Industrial Management > Electronic Thesis & Dissertation > Item 987654321/73903

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

Title:	平行機台具有彈性維護週期與接續完工限制求極小化總完工時間排程問題;Parallel Machine Scheduling with Flexible Maintenance and Resumable Jobs for Minimizing Total Completion Time
Authors:	蔡尚澄;Tsai, Shang-Cheng
Contributors:	工業管理研究所
Keywords:	排程;相同的平行機台;彈性維護;可接續工作;獨立整備時間;分支界線;迭代貪婪演算法;總完工時間;Scheduling;identical parallel machine;flexible maintenance;resumable job;independent setup time;branch and bound;iterated greedy algorithm;total completion time
Date:	2017-07-28
Issue Date:	2017-10-27 12:29:17 (UTC+8)
Publisher:	國立中央大學
Abstract:	本文中，我們考慮在m台相同平行機台n個可接續的工作在有彈性維護並考慮同一工作接續必須額外有整備時間的情況下，並求最小總完工時間的排程問題. 在過去的排程研究中都假設機台是可連續工作在無限延伸時間中。假設一個工作在處理階段被中斷然後再接續工作我們稱這個情形為可接續的案子，反之不可中斷且接續在同一台機器的工作我們稱為不可接續的案子。近年來，越來越多研究考慮到機台並非一直都可使用。所以彈性維護限制為要預防機台的損壞影響時間成本和產品不必要的損壞並確保製程品質水準。本研究中考慮在兩個維護的時間間隔中有最大可工作區間和最小可工作區間限制。我們會提出一個分支界限演算法去尋找這個問題的最佳解，並用貪婪演算法去找近似最佳解。;In this article, we consider the problem of scheduling n resumable jobs on the m identical parallel machine with flexible maintenance activities and sequence independent setup time, and the objective is to minimize total completion of jobs. In this past, the majority of scheduling studies assumes that machines are continuously at all time. If a job is disrupted during processing by a disrupted machine and it does not need (need) to restart after the machine becomes available again, it is called the resumable (nonresumable) case. In recent year, more and more studies consider that each machine is not continuously available. Flexible maintenance activity constraints mean that each machine must be maintained after a continuous period of time to prevent machine failure and maintain the quality of the process. This study considers the minimum working time and maximum working time within any two consecutive maintenance activities. We develop a branch and bound algorithm and a greedy algorithm and try to find the optimal solution in our problem. Keywords: Scheduling, identical parallel machine, flexible maintenance, resumable job, independent setup time, branch and bound, iterated greedy algorithm, total completion time.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	286	View/Open

社群 sharing

Loading...