Minimizing Total Flowtime with Arrival Time in Batches on Identical Parallel Machines

• Main Authors: Tsui-Ping Chung, 鍾翠萍
• Other Authors: Ling-Huey Su
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/02292190095830243568

碩士 === 中原大學 === 工業工程研究所 === 95 === 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%.