An Improved Genetic Algorithm for Flexible Job-Shop Scheduling Problems

Abstract:

The flexible job-shop scheduling algorithm with the high computational complexity is important in both fields of production management and combinatorial optimization. We developed an improved genetic approach for the flexible job-shop scheduling problem (FJSP), since it is quite difficult to achieve an optimal solution to this problem within reasonable computation time. A chromosome representation combines both routing and sequencing information is represented with genetic algorithms (GAs) commonly optimize the problem by minimizing an objective, makespan. Our algorithm selects the chromosome according to different objectives, and crossover each other to maintain the species diversity. New crossover and the mutation operators utilize the critical path with certain probability to modify assignment and sequence for preventing being trapped in a local optimum. The results obtained from the computational study have shown that the proposed algorithm is an effective approach for the FJSP.

• Periodical: Advanced Materials Research (Volumes 798-799)
• Pages: 345-348
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.798-799.345
• Online since: September 2013
• Authors: Yan Kang, Zhong Min Wang, Ying Lin, Yi Fan Zhang
• Keywords: Combinatorial Optimization, Flexible Job-Shop Scheduling, Genetic Algorithm (GA), Heuristic, Multi-Objective Selection

References

[1] Garey, M. R., Johnson, D. S., and Sethi, R. The complexity of flowshop and job shop scheduling. Mathematics of Operations Research, Vol. 1(2) (1976), pp.117-129.

DOI: 10.1287/moor.1.2.117

[2] Pezzella, F., Morganti, G., & Ciaschetti, G. A genetic algorithm for the flexible job-shop scheduling problem. Computers and Operations Research, Vol. 35 (2008), p.3202–3212.

DOI: 10.1016/j.cor.2007.02.014

[3] Liouane, N., Saad, I., Hammadi, S., & Borne, P. Ant systems & local search optimization for flexible job-shop scheduling production. International Journal of Computers, Communications & Control, Vol. 2 (2007), p.174–184.

DOI: 10.15837/ijccc.2007.2.2350

[4] Saidi-mehrabad, M., & Fattahi, P. Flexible job shop scheduling with tabu search algorithms. International Journal of Advanced Manufacturing Technology, Vol. 32 (2007), p.563–570.

DOI: 10.1007/s00170-005-0375-4

[5] Xing, L. N., Chen, Y. W., & Yang, K. W. Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Applied Soft Computing, Vol. 9(2009), p.362–376.

DOI: 10.1016/j.asoc.2008.04.013

[6] Gao, L., Peng, C. Y., Zhou, C., Li, P. G. Solving flexible job shop scheduling problem using general particle swarm optimization. In Proceedings of the 36th CIE conference on computers & industrial engineering (2006), p.3018–3027.

[7] Paulli J. A hierarchical approach for the FMS scheduling problem. European Journal of Operational Research Vol. 86(1) (1995), P. 32–42.

DOI: 10.1016/0377-2217(95)00059-y

[8] Brandimarte P. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research Vol. 41(1993), p.157–183.

DOI: 10.1007/bf02023073

[9] Mastrolilli M, Gambardella LM. Effective neighbourhood functions for the flexible job shop problem. Journal of Scheduling Vol. 3(1996), p.3–20.

DOI: 10.1002/(sici)1099-1425(200001/02)3:1<3::aid-jos32>3.0.co;2-y

[10] Chen H, IhlowJ, Lehmann C. Agenetic algorithm for flexible Job-shop scheduling. In: IEEE international conference on robotics and automation, Detroit; 1999. p.1120–1125.

DOI: 10.1109/robot.1999.772512

[11] Jia HZ, Nee AYC, Fuh JYH, Zhang YF. A modified genetic algorithm for distributed scheduling problems. International Journal of Intelligent Manufacturing Vol. 14(2003), p.351–362.

[12] Kacem I, Hammadi S, Borne P. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C, Vol. 32(1) (2002), P. 1–13.

DOI: 10.1109/tsmcc.2002.1009117