Bi-objective Optimization in Identical Parallel Machine Scheduling Problem

This paper presents bi-objective identical parallel machine scheduling problem with minimization of weighted sum of makespan and number of tardy jobs simultaneously. It is a known fact that identical parallel machine scheduling problem with makespan and number of tardy jobs based criteria is NP hard. Metaheuristics has become most important choice for solving NP hard problems because of their multi-solution and strong neighborhood search capabilities in a reasonable time. In this work Simulated Annealing Algorithm SA and Genetic Algorithm GA has been proposed to optimize two different objectives namely i minimization of make span ii minimization of number of tardy jobs using combined objective function COF. The effectiveness of the proposed algorithm have been analyzed by means of benchmark problem taken from the literatures and relative performance measures for the algorithm have also been computed and analyzed. Computational results show that GA outperforms SA by a considerable margin.

[1]  Baoqiang Fan,et al.  Bi-criteria scheduling on a single parallel-batch machine , 2012 .

[2]  S.M.T. Fatemi Ghomi,et al.  A pairwise interchange algorithm for parallel machine scheduling , 1998 .

[3]  Jatinder N. D. Gupta,et al.  Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time , 2003, J. Oper. Res. Soc..

[4]  Yun-Chia Liang,et al.  Metaheuristics for drilling operation scheduling in Taiwan PCB industries , 2013 .

[5]  J. Riera,et al.  Approximate algorithms for theP‖Cmax problem , 1996 .

[6]  Jing Chen,et al.  A hybrid dynamic harmony search algorithm for identical parallel machines scheduling , 2012 .

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Chung-Yee Lee,et al.  Multiprocessor scheduling: combining LPT and MULTIFIT , 1988, Discret. Appl. Math..

[9]  Cyril Briand,et al.  Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds , 2013, RAIRO Oper. Res..

[10]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[11]  Ali Husseinzadeh Kashan,et al.  A discrete particle swarm optimization algorithm for scheduling parallel machines , 2009, Computers & industrial engineering.

[12]  Peter Chen,et al.  A simulated annealing approach to makespan minimization on identical parallel machines , 2006 .

[13]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[14]  Jatinder N. D. Gupta,et al.  A LISTFIT heuristic for minimizing makespan on identical parallel machines , 2001 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Yunqiang Yin,et al.  A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents , 2013, Appl. Soft Comput..