Skip to main content

Advertisement

SpringerLink
Log in

Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms

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

Abstract

In contrast to traditional job-shop scheduling problems, various complex constraints must be considered in distributed manufacturing environments; therefore, developing a novel scheduling solution is necessary. This paper proposes a hybrid genetic algorithm (HGA) for solving the distributed and flexible job-shop scheduling problem (DFJSP). Compared with previous studies on HGAs, the HGA approach proposed in this study uses the Taguchi method to optimize the parameters of a genetic algorithm (GA). Furthermore, a novel encoding mechanism is proposed to solve invalid job assignments, where a GA is employed to solve complex flexible job-shop scheduling problems (FJSPs). In addition, various crossover and mutation operators are adopted for increasing the probability of finding the optimal solution and diversity of chromosomes and for refining a makespan solution. To evaluate the performance of the proposed approach, three classic DFJSP benchmarks and three virtual DFJSPs were adapted from classical FJSP benchmarks. The experimental results indicate that the proposed approach is considerably robust, outperforming previous algorithms after 50 runs.

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

Similar content being viewed by others

References

  • AitZai, A., Benmedjdoub, B., & Boudhar, M. (2014). Branch-and-bound and PSO algorithms for no-wait job shop scheduling. Journal of Intelligent Manufacturing. doi:10.1007/s10845-014-0906-7

  • Behnamian, J., & Fatemi Ghomi, S. M. T. (2014). A survey of multi-factory scheduling. Journal of Intelligent Manufacturing. doi:10.1007/s10845-014-0890-y

  • Brandimarte, P. (1993). Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 41(3), 157–183. doi:10.1007/BF02023073.

    Article  Google Scholar 

  • Chan, F. T. S., Chung, S. H., & Chan, P. L. Y. (2005). An adaptive genetic algorithm with dominated genes for distributed scheduling problems. Expert Systems with Applications, 29(2), 364–371. doi:10.1016/j.eswa.2005.04.009.

    Article  Google Scholar 

  • Chan, F. T. S., Chung, S. H., Chan, L. Y., Finke, G., & Tiwari, M. K. (2006). Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach. Robotics and Computer-Integrated Manufacturing, 22(5–6), 493–504. doi:10.1016/j.rcim.2005.11.005.

    Article  Google Scholar 

  • Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms—I. Representation. Computers & Industrial Engineering, 30(4), 983–997. doi:10.1016/0360-8352(96)00047-2.

    Article  Google Scholar 

  • Cheng, R., Gen, M., & Tsujimura, Y. (1999). A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: Hybrid genetic search strategies. Computers & Industrial Engineering, 36(2), 343–364. doi:10.1016/S0360-8352(99)00136-9.

    Article  Google Scholar 

  • De Giovanni, L., & Pezzella, F. (2010). An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. European Journal of Operational Research, 200(2), 395–408. doi:10.1016/j.ejor.2009.01.008.

    Article  Google Scholar 

  • Delice, Y., Kızılkaya Aydoğan, E., Özcan, U., & İlkay, M. (2014). A modified particle swarm optimization algorithm to mixed-model two-sided assembly line balancing. Journal of Intelligent Manufacturing. doi:10.1007/s10845-014-0959-7

  • Gao, K. Z., Suganthan, P. N., Pan, Q. K., Chua, T. J., Cai, T. X., & Chong, C. S. (2014). Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives. Journal of Intelligent Manufacturing. doi:10.1007/s10845-014-0869-8

  • Gao, J., Sun, L., & Gen, M. (2008). A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Computers & Operations Research, 35(9), 2892–2907. doi:10.1016/j.cor.2007.01.001.

    Article  Google Scholar 

  • Gen, M., Gao, J., & Lin, L. (2009). Multistage-based genetic algorithm for flexible job-shop scheduling problem. In M. Gen, D. Green, O. Katai, B. McKay, A. Namatame, R. Sarker, et al. (Eds.), Intelligent and evolutionary systems (Vol. 187, pp. 183–196). Berlin, Heidelberg: Springer. (Studies in Computational Intelligence).

    Chapter  Google Scholar 

  • Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Boston: Addison-Wesley Longman.

    Google Scholar 

  • Gong, H., Chen, D., & Xu, K. (2014). Parallel-batch scheduling and transportation coordination with waiting time constraint. The Scientific World Journal. doi:10.1155/2014/356364

  • Hao, X., Gen, M., Lin, L., & Suer, G. (2015). Effective multiobjective EDA for bi-criteria stochastic job-shop scheduling problem. Journal of Intelligent Manufacturing. doi:10.1007/s10845-014-1026-0

  • Herrera, F., & Lozano, M. (1996). Adaptation of genetic algorithm parameters based on fuzzy logic controllers. Genetic Algorithms and Soft Computing, 8, 95–125.

  • Ho, N. B., Tay, J. C., & Lai, E. M. K. (2007). An effective architecture for learning and evolving flexible job-shop schedules. European Journal of Operational Research, 179(2), 316–333. doi:10.1016/j.ejor.2006.04.007.

    Article  Google Scholar 

  • İnkaya, T., & Akansel, M. (2015). Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach. Journal of Intelligent Manufacturing. doi:10.1007/s10845-015-1041-9

  • Jia, H. Z., Nee, A. Y. C., Fuh, J. Y. H., & Zhang, Y. F. (2003). A modified genetic algorithm for distributed scheduling problems. Journal of Intelligent Manufacturing, 14(3–4), 351–362. doi:10.1023/A:1024653810491.

    Article  Google Scholar 

  • Jian-Bo, Y. (2001). GA-based discrete dynamic programming approach for scheduling in FMS environments. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 31(5), 824–835. doi:10.1109/3477.956045.

    Article  Google Scholar 

  • Kacem, I., Hammadi, S., & Borne, P. (2002a). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 32(1), 1–13. doi:10.1109/TSMCC.2002.1009117.

  • Kacem, I., Hammadi, S., & Borne, P. (2002b). Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60(3–5), 245–276. doi:10.1016/S0378-4754(02)00019-8.

  • Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., & Tsuruoka, S. (2001). Genetic algorithm with the constraints for nurse scheduling problem. In Evolutionary Computation, 2001. Proceedings of the 2001 congress on, 2001 (Vol. 2, pp. 1123–1130, vol. 1122). doi:10.1109/CEC.2001.934317

  • Kim, D.-W., Kim, K.-H., Jang, W., & Frank Chen, F. (2002). Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics and Computer-Integrated Manufacturing, 18(3–4), 223–231. doi:10.1016/S0736-5845(02)00013-3.

    Article  Google Scholar 

  • Mesghouni, K., Hammadi, S., & Borne, P. (1997). Evolution programs for job-shop scheduling. In Systems, man, and cybernetics, 1997. Computational cybernetics and simulation., 1997 IEEE International conference on, 12–15 Oct 1997 (Vol. 1, pp. 720–725, vol. 721). doi:10.1109/ICSMC.1997.625839

  • Nouiri, M., Bekrar, A., Jemai, A., Niar, S., & Ammari, A. (2015). An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem. Journal of Intelligent Manufacturing. doi:10.1007/s10845-015-1039-3

  • Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers & Operations Research, 35(10), 3202–3212. doi:10.1016/j.cor.2007.02.014.

    Article  Google Scholar 

  • Tay, J., & Wibowo, D. (2004). An effective chromosome representation for evolving flexible job shop schedules. In K. Deb (Ed.), Genetic and evolutionary computation—GECCO 2004, Lecture Notes in Computer Science (Vol. 3103, pp. 210–221). Berlin, Heidelberg: Springer.

  • Toksarı, M. D., Oron, D., & Aydoğan, E. K. (2014). New developments in scheduling applications. The Scientific World Journal. doi:10.1155/2014/268941

  • Tung-Kuan, L., Yeh-Peng, C., & Jyh-Horng, C. (2014). Developing a multiobjective optimization scheduling system for a screw manufacturer: A refined genetic algorithm approach. IEEE Access, 2, 356–364. doi:10.1109/ACCESS.2014.2319351.

    Article  Google Scholar 

  • Watanabe, M., Ida, K., & Gen, M. (2005). A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers & Industrial Engineering, 48(4), 743–752. doi:10.1016/j.cie.2004.12.008.

  • Yilmaz Eroglu, D., & Ozmutlu, H. C. (2014). MIP models and hybrid algorithms for simultaneous job splitting and scheduling on unrelated parallel machines. The Scientific World Journal. doi:10.1155/2014/519520

  • Zhang, G., Gao, L., & Shi, Y. (2011). An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, 38(4), 3563–3573. doi:10.1016/j.eswa.2010.08.145.

    Article  Google Scholar 

  • Zhang, G.-Q., Wang, J.-J., & Liu, Y.-J. (2014). Scheduling jobs with variable job processing times on unrelated parallel machines. The Scientific World Journal. doi:10.1155/2014/242107

Download references

Acknowledgments

This work was partially supported by the Ministry of Science and Technology, Taiwan (R.O.C.), under Grant No. 103-2221-E-327-031-, and by the Bureau of Energy, Ministry of Economic Affairs, Taiwan (R.O.C.), under Grant No. 102-D0629.

Conflict of interest

The authors declare no conflicts of interest regarding the publication of this paper.

Author information

Authors and Affiliations

  1. Institute of Engineering Science and Technology, National Kaohsiung First University of Science and Technology, 1 University Road, Yenchao, Kaohsiung, 824, Taiwan, ROC

    Hao-Chin Chang & Tung-Kuan Liu

Authors
  1. Hao-Chin Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tung-Kuan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tung-Kuan Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chang, HC., Liu, TK. Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J Intell Manuf 28, 1973–1986 (2017). https://doi.org/10.1007/s10845-015-1084-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-015-1084-y

Keywords

Search

Navigation