Tabu search algorithm for flexible job shop with batch processing to minimize the makespan

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

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

Title:	Tabu search algorithm for flexible job shop with batch processing to minimize the makespan
Authors:	唐祈;Tang, Chi
Contributors:	工業管理研究所
Keywords:	彈性式零工式生產;批量;機台限制;禁忌搜尋法;最晚完工時間;Flexible job shop;Batch processing;Makespan;Machine eligibility;Tabu search
Date:	2022-07-05
Issue Date:	2022-10-04 10:48:53 (UTC+8)
Publisher:	國立中央大學
Abstract:	本研究主旨在於探討彈性式零工式生產上考慮批次生產以及機台限制的排程問題，目標為最小化最大完工時間。此排程問題是半導體產業實務上所面對的問題。針對此問題，我們使用 batch-oblivious 分離圖來表示並且提出建築於此分離圖的禁忌搜尋法來解決此問題。為使禁忌搜尋法可以有效地處裡批次生產，我們應用了一計算各工件起始時間的過程，透過在遍歷整個分離圖的過程中，去盡可能的填滿個個批次，提升各個批次的使用率。在實驗部分，我們透過與不同指標性的數值結果比較，去證明我們所提出之禁忌搜尋法的通用性和適用性。;In this paper, we study a scheduling problem on the flexible job shop problem with batching processing and machine eligibility constraint which objective is minimizing the makespan. We use the novel disjunctive graph, the batch-oblivious disjunctive graph, to represent this scheduling problem. We propose the tabu search algorithm based on the batch-oblivious disjunctive graph to solve the problem. More addition, to tackle the batching process, we apply the adaptive start computation procedure to take batching decisions during traversals disjunctive graph. In computational results, we compare our result with benchmark instances of different problems prove the applicability of our algorithm.
Appears in Collections:	[Graduate Institute of Industrial Management] Electronic Thesis & Dissertation

Files in This Item:

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

社群 sharing

Loading...