Skip to main content
SpringerLink
Log in

An improved artificial algae algorithm integrated with differential evolution for job-shop scheduling problem

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

For the past decades, practitioners and researchers have been fascinated by the job-shop scheduling problems (JSSP) and have proposed many pristine meta-heuristic algorithms to solve them. JSSP is an NP-hard problem and a combinatorial optimization problem. This paper proposes a highly efficient and superior performance strategy for the artificial algae algorithm (AAA) integrated with the differential evolution (DE), denoted AAADE, to solve JSSP. The new movement algae colonies using DE operators are introduced to the proposed hybrid artificial algae algorithm and DE (AAADE). To improve AAA’s intensification ability, the movement using the DE mutation is implemented into the AAA. In the new hybrid method, the DE crossover can update its position based on both movements (helical and DE movements) to increase randomization. Two categories of problems verify the efficiency and validity of the proposed hybrid algorithm, AAADE, namely, CEC 2014 benchmark functions and different job-shop scheduling problems. The AAADE results are compared with other algorithms in the literature. Hence, comparisons numerical experiments validated and verified the quality of the proposed algorithm. Experimental results validate the effectiveness of the proposed hybrid method in producing excellent solutions that are promising and competitive to the state-of-the-art heuristic-based algorithms reported in the literature in most of the benchmark functions in CEC’14 and JSSP.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Ali, A. F., & Tawhid, M. A. (2015). Hybrid particle swarm optimization with a modified arithmetical crossover for solving unconstrained optimization problems. INFOR: Information Systems and Operational Research, 53(3), 125–141.

  • Ali, A. F., & Tawhid, M. A. (2016). Hybrid simulated annealing and pattern search method for solving minimax and integer programming problems. Pacific Journal of Optimization, 12(1), 151–184.

    Google Scholar 

  • Asadzadeh, L. (2015). A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Computers& Industrial Engineering, 85, 376–383.

    Article  Google Scholar 

  • Asadzadeh, L., & Zamanifar, K. (2010). An agent-based parallel approach for the job shop scheduling problem with genetic algorithms. Mathematical and Computer Modelling, 52(11–12), 1957–1965.

    Article  Google Scholar 

  • Balande, U., & Shrimankar, D. (2020). A modified teaching learning metaheuristic algorithm with opposite-based learning for permutation flow-shop scheduling problem. Evolutionary Intelligence, 1–23.

  • Baykasoğlu, A., Hamzadayi, A., & Köse, S. Y. (2014). Testing the performance of teaching-learning based optimization (tlbo) algorithm on combinatorial problems: Flow shop and job shop scheduling cases. Information Sciences, 276, 204–218.

    Article  Google Scholar 

  • Cong, S., Li, G., & Feng, X. (2010). An improved algorithm of chaos optimization. IEEE ICCA, 2010, 1196–1200.

    Google Scholar 

  • Dabah, A., Bendjoudi, A., AitZai, A., El-Baz, D., & Nouali Taboudjemat, N. (2016). Multi and many-core parallel B&B approaches for the blocking job shop scheduling problem. In 2016 IEEE international conference on high performance computing simulation (HPCS) (pp. 705–712).

  • Gen, M., & Lin, L. (2014). Multiobjective evolutionary algorithm for manufacturing scheduling problems: State-of-the-art survey. Journal of Intelligent Manufacturing, 25(5), 849–866.

    Article  Google Scholar 

  • Gong, G., Chiong, Q, Deng, R., & Luo, Q. (2020). A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption. Journal of Intelligent Manufacturing, 1–24.

  • Ibrahim, A. M., & Tawhid, M. A. (2019). A hybridization of cuckoo search and particle swarm optimization for solving nonlinear systems. Evolutionary Intelligence, 12(4), 541–561.

    Article  Google Scholar 

  • Ibrahim, A. M., & Tawhid, M. A. (2019). A hybridization of differential evolution and monarch butterfly optimization for solving systems of nonlinear equations. Journal of Computational Design and Engineering, 6(3), 354–367.

    Article  Google Scholar 

  • Ibrahim, A. M., Tawhid, M. A., & Ward, R. K. (2020). A binary water wave optimization for feature selection. International Journal of Approximate Reasoning, 120, 74–91.

    Article  Google Scholar 

  • Ibrahim, A. M., & Tawhid, M. A. (2021). A new hybrid binary algorithm of bat algorithm and differential evolution for feature selection and classification. In Applications of bat algorithm and its variants (pp. 1–18). Springer.

  • Jain, V., & Grossmann, I. E. (2001). Algorithms for hybrid milp/cp models for a class of optimization problems. INFORMS Journal on Computing, 13(4), 258–276.

    Article  Google Scholar 

  • Jiang, T. (2018). A hybrid grey wolf optimization for job shop scheduling problem. International Journal of Computational Intelligence and Applications, 17(03), 1850016.

    Article  Google Scholar 

  • Jiang, T., & Zhang, C. (2018). Application of grey wolf optimization for solving combinatorial problems: Job shop and flexible job shop scheduling cases. IEEE Access, 6, 26231–26240.

    Article  Google Scholar 

  • Khadwilard, A., Chansombat, S., Thepphakorn, T., Thapatsuwan, P., Chainate, W., & Pongcharoen, P. (2011). Investigation of firefly algorithm parameter setting for solving job shop scheduling problems. Operation Research Network in Thailand, 89–97.

  • Khalilpourazari, S., & Khalilpourazary, S. (2018). A robust stochastic fractal search approach for optimization of the surface grinding process. Swarm and Evolutionary Computation, 38, 173–186.

    Article  Google Scholar 

  • Kommadath, R., & Kotecha, P. (2020) Scheduling of jobs on dissimilar parallel machine using computational intelligence algorithms (pp. 441–464).

  • Kuo, I.-H., Horng, S.-J., Lee, T.-L., Kao, C.-L., Lin, T.-W., Terano, T., & Pan, Y. (2009). An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model. Expert Systems with Applications,36(3), 7027–7032.

  • Lamoudan, T., Khoukhi, F., Alaoui, A., & Boukachour, J. (2011). Flow shop scheduling problem with transportation times, two-robots and inputs/outputs with limited capacity. International Journal of Intelligent Computing Research, 2(10), 12.

    Google Scholar 

  • Liang, J. J., Qu, B. Y., & Suganthan, P. N. (2013). Problem definitions and evaluation criteria for the cec 2014 special session and competition on single objective real-parameter numerical optimization. Technical Report: Zhengzhou University and Nanyang Technological University.

  • Lu, Y., & Jiang, T. (2019). Bi-population based discrete bat algorithm for the low-carbon job shop scheduling problem. IEEE Access, 7, 14513–14522.

    Article  Google Scholar 

  • Mirjalili, S., & Lewis, A. (2014). Adaptive gbest-guided gravitational search algorithm. Neural Computing and Applications, 25(7–8), 1569–1584.

    Article  Google Scholar 

  • Nasir, Md., Das, Swagatam, Maity, Dipankar, Sengupta, Soumyadip, Halder, Udit, & Suganthan, P. N. (2012). A dynamic neighborhood learning based particle swarm optimizer for global numerical optimization. Information Sciences, 209, 16–36.

    Article  Google Scholar 

  • Pinedo, M., & Hadavi, K. (1992). Scheduling: theory, algorithms and systems development. In Operations research proceedings 1991 (pp. 35–42). Springer.

  • Saidi-Mehrabad, M., & Fattahi, P. (2007). Flexible job shop scheduling with tabu search algorithms. The international journal of Advanced Manufacturing technology, 32(5–6), 563–570.

    Article  Google Scholar 

  • Savsani, V., & Tawhid, M. A. (2017). Non-dominated sorting moth flame optimization (ns-mfo) for multi-objective problems. Engineering Applications of Artificial Intelligence, 63, 20–32.

    Article  Google Scholar 

  • Savsani, P., & Tawhid, M. A. (2018). Discrete heat transfer search for solving travelling salesman problem. Mathematical Foundations of Computing, 1(3), 265.

    Article  Google Scholar 

  • Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278 – 285 (Project Management and Scheduling).

  • Tawhid, M. A., & Ali, A. F. (2016). A simplex social spider algorithm for solving integer programming and minimax problems. Memetic Computing, 8(3), 169–188.

    Article  Google Scholar 

  • Tawhid, M. A., & Ali, A. F. (2017a). A hybrid social spider optimization and genetic algorithm for minimizing molecular potential energy function. Soft Computing, 21(21), 6499–6514.

  • Tawhid, M. A., & Ali, A. F. (2017b). Multi-directional bat algorithm for solving unconstrained optimization problems. OPSEARCH, 54(4), 684–705.

  • Tawhid, M. A., & Ali, A. F. (2017c). A simplex grey wolf optimizer for solving integer programming and minimax problems. Numerical Algebra, Control & Optimization, 7(3), 301–323.

  • Tawhid, M. A., & Ibrahim, A. M. (2020a). A hybridization of grey wolf optimizer and differential evolution for solving nonlinear systems. Evolving Systems, 11(1), 65–87.

  • Tawhid, M. A., & Ibrahim, A. M. (2020b). Feature selection based on rough set approach, wrapper approach, and binary whale optimization algorithm. International Journal of Machine Learning and Cybernetics, 11(3), 573–602.

  • Tawhid, M. A., & Savsani, P. (2019a). Discrete sine-cosine algorithm (dsca) with local search for solving traveling salesman problem. Arabian Journal for Science and Engineering, 44(4), 3669–3679.

  • Tawhid, M. A., & Savsani, V. (2019b). Multi-objective sine-cosine algorithm (mo-sca) for multi-objective engineering design problems. Neural Computing and Applications, 31(2), 915–929.

  • Uymaz, S. A., Tezel, G., & Yel, E. (2015). Artificial algae algorithm (aaa) for nonlinear global optimization. Applied Soft Computing, 31, 153–171.

    Article  Google Scholar 

  • Wu, X., Peng, J., Xiao, X., & Wu, S. (2021). An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading. Journal of Intelligent Manufacturing, 32(3), 707–728.

    Article  Google Scholar 

  • Xinyi, S., Aimin, W., Yan, G., & Jieran, Y. (2020). Job shop scheduling problem with job sizes and inventories. In 2020 IEEE 11th international conference on mechanical and intelligent manufacturing technologies (ICMIMT) (pp. 202–206).

  • Xu, H., Liu, X., & Su, J. (2017). An improved grey wolf optimizer algorithm integrated with cuckoo search. In 2017 9th IEEE international conference on intelligent data acquisition and advanced computing systems: Technology and applications (IDAACS) (Vol. 1, pp. 490–493).

  • Yang, X. S. (2010). Nature-inspired metaheuristic algorithms. Luniver Press.

  • Yang, D., Liu, Z., & Zhou, J. (2014). Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization. Communications in Nonlinear Science and Numerical Simulation, 19(4), 1229–1246.

    Article  Google Scholar 

  • Ying, K.-C. (2008). Solving non-permutation flowshop scheduling problems by an effective iterated greedy heuristic. The International Journal of Advanced Manufacturing Technology, 38(3–4), 348.

    Article  Google Scholar 

  • Zhang, C., Ning, J., & Ouyang, D. (2010). A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Computers& Industrial Engineering, 58(1), 1–11.

    Article  Google Scholar 

Download references

Acknowledgements

We are thankful to the associate editor and anonymous referees for the careful reading of the paper and for their valuable comments and detailed suggestions helped us to improve considerably the manuscript. The research of the 2nd author is supported in part by the Natural Sciences and Engineering Research Council of Canada (NSERC).

Author information

Authors and Affiliations

  1. Department of Mathematics, Faculty of Science, Al-Azhar University, Assiut Branch, Assiut, Egypt

    Abdelmonem M. Ibrahim

  2. Department of Mathematics and Statistics, Faculty of Science, Thompson Rivers University, Kamloops, BC, V2C 0C8, Canada

    Mohamed A. Tawhid

Authors
  1. Abdelmonem M. Ibrahim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed A. Tawhid
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohamed A. Tawhid.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ibrahim, A.M., Tawhid, M.A. An improved artificial algae algorithm integrated with differential evolution for job-shop scheduling problem. J Intell Manuf 34, 1763–1778 (2023). https://doi.org/10.1007/s10845-021-01888-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-021-01888-8

Keywords

Search

Navigation