A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem.pdfVIP

Hindawi Publishing Corporation Advances in Artificial Intelligence Volume 2010, Article ID 943050, 10 pages doi:10.1155/2010/943050 Research Article A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem Xiaohui Li, Lionel Amodeo, Farouk Yalaoui, and Hicham Chehade Universite de Technologie de Troyes, Institut Charles Delaunay, LOSI (UMR-STMR 6279), ´ 12 Rue Marie Curie BP 2060 10010 Troyes Cedex, France Correspondence should be addressed to Xiaohui Li, xiaohui.li@utt.fr Received 23 March 2010; Revised 22 July 2010; Accepted 27 October 2010 Academic Editor: Fakhreddine Karray Copyright © 2010 Xiaohui Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. A multiobjective optimization problem which focuses on parallel machines scheduling is considered. This problem consists of scheduling n independent jobs on m identical parallel machines with release dates, due dates, and sequence-dependent setup times. The preemption of jobs is forbidden. The aim is to minimize two different objectives: makespan and total tardiness. The contribu- tion of this paper is to propose first a new mathematical model for this specific problem. Then, since this problem is NP hard in the strong sense, two well-known approximated methods, NSGA-II and SPEA-II, are adopted to solve it. Experimental results show the advantages of NSGA-II for the studied problem. An exact method is then applied to be compared with NSGA-II algorithm in order to prove the efficiency of the former. Experimental results show the advantages of NSGA-II for the studied problem. Computational experiments show