雙機流程型生產環境下具批量與等候時間限制和機台架設時間的多產品排程問題;Lot streaming for multiple products in two-machine flow shops with limited waiting time constraint and setup time

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

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

Title:	雙機流程型生產環境下具批量與等候時間限制和機台架設時間的多產品排程問題;Lot streaming for multiple products in two-machine flow shops with limited waiting time constraint and setup time
Authors:	王亭鈞;Wang, Ting-Chun
Contributors:	工業管理研究所
Keywords:	排程;批量;雙機台流程;機台架設時間;等候時間限制;最大完工時間;分支界線法;Scheduling;lot-streaming;two-machines flow shops;setup times;limited waiting time constraint;makespan;branch and bound algorithm
Date:	2017-07-25
Issue Date:	2017-10-27 12:28:33 (UTC+8)
Publisher:	國立中央大學
Abstract:	本研究探討雙機台流程式生產環境下具批量與等候時間限制和幾台架設時間的多產品排程問題。本研究使用的方法是用批量的方式來減少完工時間，並且使用分支界線法來計算。此篇探討2機台和n個產品，每個產品都有不同的架設時、工作時間和等候時間的限制。每一個產品要進入到幾台1的時候，都會先有架設時間，接著要考量此產品的等候時間限制，要在等候時間內到機台2工作，最後的到完工時間。在批量生產的情況下完工時間會縮短，因此探討批量生產來減少完工時間。等候時間限制的情況是每個產品都有的屬性範圍，實際的等候時間不能超過產品等候時間最大上限。本文建構一個分枝界線演算法來求得最佳的完工時間，並且分析此分枝界線演算法的成效，使用四種特性和上下限來使分支界線法的效率更佳化，最後分析分支界線法的成效和數據的分析。 ;The purpose of this study is to treat the optimal lot streaming for multiple products in two-machine flow shops with limited waiting time constraint and setup time for multiple products. In this study, we will introduce about lot streaming and calculate the optimal size. We also use the branch and bound algorithm to obtain the optimal solution. Our objective is to minimize the makespan in lot streaming manufacturing system. Lot streaming is the method that can produce sublots to reduce the makespan and operations can be overlapped. Besides the lot streaming, we also consider about some constraints. We consider limited waiting time and setup time in different products. Limited waiting time constraint is that the products must be transferred to next the machine in the specific time range. Additionally, the limited waiting time constraint is that the waiting time cannot be greater than the upper waiting time. There is setup time in different machines when different products are processed on different machines. At last, we will construct the branch-and-bound algorithm and use the bounding to eliminate nodes efficiently. According to four properties, upper bound and lower bound the efficiency of the algorithm can be promoted. After constructing the branch-and-bound algorithm, we will analyze the performance of the algorithm and data.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

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

社群 sharing

Loading...