Genetic Algorithm Modification for Production Scheduling

Open access


Scheduling of production soundly affects its capacity especially if system does complex production jobs. In the theoretical part of the article an overview of the scheduling methods proposed in the literature was presented. In this paper it was stated a variant of job shop problem, in which jobs can overlap in some machines and omit others. Authors designed and presented here genetic algorithm to optimize solution of such a problem. The algorithm finds jobs sequence priority and in accordance with it schedules operations and calculates their completion time. An adequate problem was met in an examined plant, where 20 production jobs consisted of 11 to 20 operations assigned to at most 15 machines. Such big parameter numbers are crucial for big formal models and their solution algorithms. The designed algorithm proved to deal with parameters scale, as it found the schedule with 23,8% shorter jobs completion time in comparison with FIFO heuristic, that has been used so far by the plant.

[1] Barney J.B., Clark D.N., Resource-Based Theory: Creating and SustainingCompetitive Advantage, Oxford University Press, New York 2007, 18.

[2] Beksiak J., Economics (Ekonomia), PWN, Warsaw 2001, 112.

[3] Błażewicz, J., Domschke, W., Pesch, E., The job shop scheduling problem: Conventional and new solution techniques. European Journal of OperationalResearch, 93, 1996, 1-30.

[4] Eiben A.E., Smith J.E., Introduction to Evolutionary Computing, Natural ComputingSeries, Springer, Berlin 2008.

[5] Gao J., Gen M., Sun L. A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem, GECCO '06: Proceedings of the 8th annualconference on Genetic and evolutionary computation, ACM 2006, 1158.

[6] Goldberg D.E., Genetic Algorithms in Search, Optimization, and Machine Learning, Dorling Kindersley Pvt Ltd, New Delhi 2008, 17.

[7] Grimes D., Hebrard E., Model and strategies for variants of the job shop scheduling problem, CP'11: Proceedings of the 17th international conference on Principles andpractice of constraint programming, Springer-Verlag, Berlin 2011.

[8] Gromicho J.A.S., van Hoorn J.J., Saldanha da Gamma F., Timmer G.T., Solving the job shop scheduling problem optimally by dynamic programming, Computers &Operations Research; 39, 12, 2012, 2968-2977, DOI: 10.1016/j.cor.2012.02.024

[9] Manolas D.A., Gialamas T., Tsahalis D.T. A genetic algorithm for the simultaneous optimization of the sensor and actuator positions for an active noise and/or vibration control system, Inter-Noise, 96, 1996, 1187-1191.

[10] Pająk E., Production Management (Zarządzanie produkcją), PWN, Warsaw 2006, 28, 202-232.

[11] Qing-dao-er-ji R., Yuping W., A new hybrid genetic algorithm for job shop scheduling problem, Computers & Operations Research, 39, 10, 2011 DOI: 10.1016/j.cor.2011.12.005.

[12] Rutkowski L., Methods and Techniques of Artifical Intelligence (Metody i technikisztucznej inteligencji), PWN Warsaw 2005, 233.

[13] Sikora W., Operations Research (Badania operacyjne), PWE, Warsaw 2008, 212.

[14] Waters D., Operations Management. Producing Goods and Services, Pearson Education Limited, Essex 2002, 220.

[15] Zhenyuan J., Xiaohong L., Jiangyuan Y., Defeng J., Research on job-shop scheduling problem based on genetic algorithm, International Journal of Production Research 49, 12, 2011 DOI: 10.1080/00207543.2010.481293.

Foundations of Computing and Decision Sciences

The Journal of Poznan University of Technology

Journal Information

CiteScore 2017: 0.82

SCImago Journal Rank (SJR) 2017: 0.212
Source Normalized Impact per Paper (SNIP) 2017: 0.523

Mathematical Citation Quotient (MCQ) 2017: 0.02

Cited By


All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 244 239 10
PDF Downloads 83 82 3