efficient heuristic to minimize makespan in single machine scheduling problem with unrelated parallel machines有效的启发式时间在单独的机器无关的平行机调度问题.pdfVIP

Intelligent Information Management, 2010, 2, 188-198 doi:10.4236/iim.2012.23022 Published Online March 2010 (http://www. SciRP.org/journal/iim) Efficient Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Unrelated Parallel Machines 1 1 2 P. Sivasankaran , T. Sornakumar , R. Panneerselvam 1 Department of Mechanical Engineering, Thiagarajar College of Engineering, Madura, India 2Department of Management Studies, School of Management, Pondicherry University, Pondicherry, India E-mail : sivasankaran.panneerselvam@, sornakumar2000@, panneer_dms@yahoo.co.in Received November 23, 2009; revised December 30, 2009; accepted February 2, 2010 Abstract This paper discusses an efficient heuristic to minimize the makespan of scheduling n independent jobs on m unrelated parallel machines. The problem of scheduling the jobs on the unrelated parallel machines is com- binatorial in nature. Hence, the heuristic approach is inevitable for quicker solution. In this paper, a simple and efficient heuristic is designed to minimize the makespan of scheduling n independent jobs on m unre- lated parallel machines. A mathematical model is also presented for this problem. A factorial experiment is used to compare the results of the proposed heuristic with that of a mathematical model by taking “Method” (Heuristic and Model) as the first factor and “Problem Size” (No. of machines X No. of Jobs: 2X5, 2X6, ……, 2X9, 3X5, 3X6, ……, 3X9, ……., 5X5, 5X6, …5X9) as the second factor. It is found that there is no significant difference between the results of the proposed heuristic and that of the mathematical model. Further, the mean percent error of