A decomposition-based heuristic algorithm for parallel batch processing problem with time window constraint.
學年 111
學期 2
出版（發表）日期 2023-04-18
作品名稱 A decomposition-based heuristic algorithm for parallel batch processing problem with time window constraint.
作品名稱（其他語言）
著者 Anh H. G. Nguyen; Gwo-Ji Sheen
單位
出版者
著錄名稱、卷期、頁數 International Journal of Industrial Engineering: Theory Applications and Practice 30(2), p.350-372
摘要 This study considers a parallel batch processing problem to minimize the makespan under constraints of arbitrary lot sizes, start time window and incompatible families. Wefirst formulate the problem witha mixed-integer programming model. Due to the NP-hardness of the problem, we develop a decomposition-based heuristic to obtain a near-optimal solution for large-scale problemswhen computational time is a concern.A two-dimensional saving function is introduced to quantify the value of time and capacity space wasted. Computational experiments show that the proposed heuristic performswell and can deal with large-scale problems efficiently within a reasonable computational time. For the small-size problems, the percentage of achieving optimal solutions by the DH is 94.17%,which indicates that the proposed heuristic is very good in solving small-size problems. For large-scale problems,our proposed heuristic outperformsan existing heuristic from the literaturein terms of solution quality
關鍵字 Scheduling; Parallel Batch Processing Problem; Time Window Constraint; Decomposition Approach; Saving Method
語言 en
ISSN 1943-670X
期刊性質 國外
收錄於 SCI
產學合作
通訊作者 Gwo-Ji Sheen
審稿制度 否
國別 USA
公開徵稿
出版型式 ,電子版
相關連結

機構典藏連結 ( http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/128709 )

SDGS 尊嚴就業與經濟發展,產業創新與基礎設施