This paper considers the identical parallel machines problem, where jobs arrive in batches. The objective is to minimize the total completion time. Since the single machine problem with job arrival time is known to be NP-hard, therefore the problem is NP-hard in the strong sense. A heuristic procedure based on a Binary Integer Programming model to level the completion time of all jobs between two consecutive batch arrival times is developed to decrease the machine idle, which in turn minimize the total job completion time. A branch and bound algorithm is proposed for benchmarking. Computational results show that the solution quality error of the heuristic is at most 6.7%.
為了持續優化網站功能與使用者體驗,本網站將Cookies分析技術用於網站營運、分析和個人化服務之目的。
若您繼續瀏覽本網站,即表示您同意本網站使用Cookies。