A Genetic Algorithm for Multiobjective Hard Scheduling Optimization


  • Elías Niño Department of Computer Science Universidad del Norte Km 5, Via Pto Colombia. Barranquilla, Colombia
  • Carlos Ardila Department of Computer Science Universidad del Norte Km 5, Via Pto Colombia. Barranquilla, Colombia
  • Alfredo Perez Department of Computer Science and Engineering University South Florida 4202 E. Fowler Ave. Tampa, Florida
  • Yezid Donoso Department of Computing and Systems Engineering Universidad de los Andes Cra 1 No. 18A-12. Bogotí¡, Colombia


Scheduling, Process, Genetic Algorithm, Local search, Pareto Front


This paper proposes a genetic algorithm for multiobjective scheduling optimization based in the object oriented design with constrains on delivery times, process precedence and resource availability. Initially, the programming algorithm (PA) was designed and implemented, taking into account all constraints mentioned. This algorithm’s main objective is, given a sequence of production orders, products and processes, calculate its total programming cost and time.
Once the programming algorithm was defined, the genetic algorithm (GA) was developed for minimizing two objectives: delivery times and total programming cost. The stages defined for this algorithm were: selection, crossover and mutation. During the first stage, the individuals composing the next generation are selected using a strong dominance test. Given the strong restrictions on the model, the crossover stage utilizes a process level structure (PLS) where processes are grouped by its levels in the product tree. Finally during the mutation stage, the solutions are modified in two different ways (selected in a random fashion): changing the selection of the resources of one process and organizing the processes by its execution time by level.
In order to obtain more variability in the found solutions, the production orders and the products are organized with activity planning rules such as EDD, SPT and LPT. For each level of processes, the processes are organized by its processing time from lower to higher (PLU), from higher to lower (PUL), randomly (PR), and by local search (LS). As strategies for local search, three algorithms were implemented: Tabu Search (TS), Simulated Annealing (SA) and Exchange Deterministic Algorithm (EDA). The purpose of the local search is to organize the processes in such a way that minimizes the total execution time of the level.
Finally, Pareto fronts are used to show the obtained results of applying each of the specified strategies. Results are analyzed and compared.


Jingjun Zhang; Yanhong Zhang; Ruizhen Gao, "Genetic Algorithms for Optimal Design of Vehicle Suspensions", Engineering of Intelligent Systems, 2006 IEEE International Conference on , vol., no., pp.1-6, 0-0 0. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1703182&isnumber=35938

Murphy, L.; Abdel-Aty-Zohdy, H.S.; Hashem-Sherif, M., "A genetic algorithm tracking model for product deployment in telecom services", Circuits and Systems, 2005. 48th Midwest Symposium on , vol., no., pp.1729-1732 Vol. 2, 7-10 Aug. 2005. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1594454&isnumber=33557

Guangyuan Liu; Jingjun Zhang; Ruizhen Gao; Yang Sun, "A Coarse-Grained Genetic Algorithm for the Optimal Design of the Flexible Multi-Body Model Vehicle Suspensions Based on Skeletons Implementing", Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on , vol., no., pp.139-142, 1-3 Nov. 2008. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4683187&isnumber=4683146

Wu Ying; Li Bin, "Job-shop scheduling using genetic algorithm", Systems, Man, and Cybernetics, 1996., IEEE International Conference on , vol.3, no., pp.1994-1999 vol.3, 14-17 Oct 1996. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=565434&isnumber=12283

Orero, S.O.; Irving, M.R., "Economic dispatch of generators with prohibited operating zones: a genetic algorithm approach", Generation, Transmission and Distribution, IEE Proceedings- , vol.143, no.6, pp.529-534, Nov 1996. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=556730&isnumber=12146

Zhao Man; TanWei; Li Xiang; Kang Lishan, "Research on Multi-project Scheduling Problem Based on Hybrid Genetic Algorithm", Computer Science and Software Engineering, 2008 International Conference on , vol.1, no., pp.390-394, 12-14 Dec. 2008. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4721769&isnumber=4721668

Xianghui Deng, "Application of Adaptive Genetic Algorithm in Inversion Analysis of Permeability Coefficients", Genetic and Evolutionary Computing, 2008. WGEC '08. Second International Conference on , vol., no., pp.61-65, 25-26 Sept. 2008. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4637395&isnumber=4637374

Yanrong Hu; Yang, S.X.; Li-Zhong Xu; Meng, Q.-H., "A Knowledge Based Genetic Algorithm for Path Planning in Unstructured Mobile Robot Environments", Robotics and Biomimetics, 2004. ROBIO 2004. IEEE International Conference on , vol., no., pp.767-772, 22-26 Aug. 2004. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1521879&isnumber=32545

Siu, N.; Elghoneimy, E.; Yunli Wang; Gruver, W.A.; Fleetwood, M.; Kotak, D.B., "Rough mill component scheduling: heuristic search versus genetic algorithms" Systems, Man and Cybernetics, 2004 IEEE International Conference on , vol.5, no., pp. 4226-4231 vol.5, 10-13 Oct. 2004. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1401194&isnumber=30426

Lee, K.Y.; Mohamed, P.S., "A real-coded genetic algorithm involving a hybrid crossover method for power plant control system design", Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on , vol.2, no., pp.1069-1074, 2002. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=10043914&isnumber=21687

Pepper, J.W.; Golden, B.L.; Wasil, E.A., "Solving the traveling salesman problem with annealing-based heuristics: a computational study", Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on , vol.32, no.1, pp.72-77, Jan 2002. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=995530&isnumber=21479

Blesa, M.J.; Hernandez, L.; Xhafa, F., "Parallel skeletons for tabu search method", Parallel and Distributed Systems, 2001. ICPADS 2001. Proceedings. Eighth International Conference on , vol., no., pp.23-28, 2001. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=934797&isnumber=20222

Rose, J.; Klebsch, W.; Wolf, J., "Temperature measurement and equilibrium dynamics of simulated annealing placements", Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on , vol.9, no.3, pp.253-259, Mar 1990. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=46801&isnumber=1771

Nińo, E.;Ardila, J. , Algoritmo Basado en Automatas Finitos Deterministas para la obtención de óptimos globales en problemas de naturaleza combinatoria. Revista de Ingeniería y Desarrollo. No 25. pp 100 - 114. ISSN 0122 - 3461.

Minzhong Liu; Xiufen Zou; Yu Chen; Zhijian Wu, "Performance assessment of DMOEA-DD with CEC 2009 MOEA competition test instances", Evolutionary Computation, 2009. CEC '09. IEEE Congress on , vol., no., pp.2913-2918, 18-21 May 2009. URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4983309&isnumber=4982922

H. Li and J.D. Landa-Silva, Evolutionary Multi-objective Simulated Annealing with Adaptive and Competitive Search Direction, Proceedings of the 2008 IEEE Congress on Evolutionary Computation (CEC 2008), IEEE Press, pp. 3310-3317, 01-06 June, 2008, Hong Kong. http://dx.doi.org/10.1109/CEC.2008.4631246



Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.