Solving the Distributed Two Machine Flow-Shop Scheduling Problem Using Differential Evolution

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10385)

Abstract

Flow-shop scheduling covers a class of widely studied optimisation problem which focus on optimally sequencing a set of jobs to be processed on a set of machines according to a given set of constraints. Recently, greater research attention has been given to distributed variants of this problem. Here we concentrate on the distributed two machine flow-shop scheduling problem (DTMFSP), a special case of classic two machine flow-shop scheduling, with the overall goal of minimising makespan. We apply Differential Evolution to solve the DTMFSP, presenting new best-known results for some benchmark instances from the literature. A comparison to previous approaches from the literature based on the Harmony Search algorithm is also given.

References

  1. 1.
    Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4–31 (2011)CrossRefGoogle Scholar
  2. 2.
    Deng, J., Wang, L., Shen, J., Zheng, X.: An improved harmony search algorithm for the distributed two machine flow-shop scheduling problem. In: Kim, J.H., Geem, Z.W. (eds.) Harmony Search Algorithm. AISC, vol. 382, pp. 97–108. Springer, Heidelberg (2016). doi: 10.1007/978-3-662-47926-1_11 CrossRefGoogle Scholar
  3. 3.
    Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Johnson, S.M.: Optimal two-and three-stage production schedules with setup times included. Naval Res. Logist. Q. 1(1), 61–68 (1954)CrossRefMATHGoogle Scholar
  5. 5.
    Lin, B.M., Hwang, F., Gupta, J.N.: Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence. J. Sched., 1–10 (2017, to appear)Google Scholar
  6. 6.
    Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. Eur. J. Oper. Res. 171(2), 674–692 (2006)CrossRefMATHGoogle Scholar
  7. 7.
    Pan, Q.K., Wang, L., Gao, L., Li, W.: An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers. Inf. Sci. 181(3), 668–685 (2011)CrossRefGoogle Scholar
  8. 8.
    Qian, B., Wang, L., Huang, D., Wang, W., Wang, X.: An effective hybrid de-based algorithm for multi-objective flow shop scheduling with limited buffers. Comput. Oper. Res. 36(1), 209–233 (2009)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341–359 (1997)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Tanabe, R., Fukunaga, A.: Success-history based parameter adaptation for differential evolution. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2013), pp. 71–78. IEEE (2013)Google Scholar
  11. 11.
    Wang, L., Pan, Q.K., Suganthan, P.N., Wang, W.H., Wang, Y.M.: A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems. Comput. Oper. Res. 37(3), 509–520 (2010)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Zhang, J., Sanderson, A.C.: JADE: adaptive differential evolution with optional external archive. IEEE Trans. Evol. Comput. 13(5), 945–958 (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Artificial Intelligence and Optimisation Research Group, School of Computer ScienceUniversity of Nottingham Ningbo ChinaNingboChina
  2. 2.School of Computer ScienceUniversity of Nottingham Ningbo ChinaNingboChina
  3. 3.Operational Research GroupQueen Mary University of LondonLondonUK

Personalised recommendations