Abstract




 
   

IJE TRANSACTIONS C: Aspects Vol. 30, No. 12 (December 2017) 1437-1446    Article in Press

PDF URL: http://www.ije.ir/Vol30/No12/C/3.pdf  
downloaded Downloaded: 0   viewed Viewed: 45

  PARETO-BASED MULTI-CRITERIA EVOLUTIONARY ALGORITHM APPROACH FOR PARALLEL MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES
 
M. Zarei, J. Rezaeian and K. Shokoufi
 
( Received: October 28, 2016 – Accepted: September 08, 2017 )
 
 

Abstract    This paper addresses the unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times that is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also to solve the model for real size applications, a pareto-based algorithm called controlled elitism non-dominated sorting genetic algorithm (CENSGA) is proposed. To validate the performance of our approach, the algorithm is examined under six performance metric measures, and compared with pareto-based algorithm NSGA-II. The experimental results indicate the effectiveness of the proposed algorithm for different problems.

 

Keywords    Multi-objective optimization, Unrelated parallel machine, Just-in-time scheduling, Controlled elitism non-dominated sorting genetic algorithm, Mixed integer programming, Sequence-dependent setup time

 

Download PDF 



International Journal of Engineering
E-mail: office@ije.ir
Web Site: http://www.ije.ir