Skip to main content

Hybrid Differential Evolution-Variable Neighborhood Search to Solve Multiobjective Hybrid Flowshop Scheduling with Job-Sequence Dependent Setup Time

  • Conference paper
  • First Online:
Book cover Advances in Swarm Intelligence (ICSI 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9712))

Included in the following conference series:

Abstract

This paper proposes a hybrid algorithm which combines the differential evolution algorithm (DE) with variable neighborhood search (VNS) to solve multi-objective hybrid flexible flowshop with job-sequence dependent setup time (HFFS/SDST). The objective is to minimize makespan and lateness maximization on a hybrid flexible flowshop. Each stage has at least two units operating in parallel machines as well as considering skipping the stage, where not all jobs must be processed at each stage of operation. The model also considers the machine’s setup time that depends on the sequence of jobs that are processed directly on the machine. Pareto solution is used as the process of collecting the points of non-dominated solutions. To evaluate the performance of our algorithm, we compare the results with those of DE-Insert and Particle Swarm Optimization (PSO)-VNS. Computational results and comparisons indicate that DE-VNS is more efective than DE-Insert and PSO-VNS.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Naderi, B., Ruiz, R., Zandieh, M.: Algorithms for a realistic variant of flow shop scheduling. Comput. Oper. Res. 37, 236–246 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ruiz, R., Antonio, J., Rodriquez, V.: Invited review: the hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205, 1–18 (2010)

    Article  Google Scholar 

  3. Ruiz, R., Rodrquez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 16, 1–18 (2010)

    Article  MathSciNet  Google Scholar 

  4. Ishibuci, H., Murata, T.A.: Balance between genetic search and local search in memetic algorithm for multiobjective permutation flowshop scheduling. IEEE Trans. Evol. Comput. 7(2), 204–223 (2003)

    Article  Google Scholar 

  5. Tasgetiren, M.F, Liang, Y.C, Sevkli, M, Gencyilmaz, G.: Particle Swarm Optimization Algorithm for Makespan and Maximum Lateness in Permutation Flowshop Sequencing Problem, Dept. of Management, Fatih University, Istambul-Turkey (2004)

    Google Scholar 

  6. Li, B.-B., Wang, L., Liu, B.: An effective PSO-based hybrid algorithm for multiobjective permutation flow shop scheduling. IEEE Trans. Syst. Manuf. Cybern. 17, 314–317 (2008)

    Google Scholar 

  7. Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P., Werner, F.: Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, dual criteria. Int. J. Adv. Manuf. Technol. 37(3), 354–370 (2008)

    Article  MATH  Google Scholar 

  8. Qian, B., Wang, L., Huang, D., X, W.: An effective hybrid DE-based algorithm for multiobjective flow shop scheduling with limited buffers. Comput. Oper. Res. 36, 209–233 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Storn, R., Price, K.: Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces. J. Global Optim. 11(4), 341–359 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  10. Yang, Z., Tang, K., Yao, X.: Self-adaptive differential evolution with neighborhood search, Evolutionary Computation. In: CEC 2008 (IEEE World Congress on Computational Intelligence), pp. 1110–1116 (2008)

    Google Scholar 

  11. Tasgetiren, M., Suganthan, P.N., Ozcan, S., Kizilay, D.: A differential evolution algorithm with a variable neighborhood search for constrained function optimization. In: Fister, I., Fister Jr., I. (eds.) Adaptation and Hybridization in Computational Intelligence. ALO, vol. 18, pp. 171–184. Springer, Heidelberg (2015)

    Google Scholar 

  12. Tasgetiren, M.F., Pan, Q.-K., Kizilay, D., Suer, G.: A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem, Evolutionary Computation. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 2797–2804 (2015)

    Google Scholar 

Download references

Acknowledgements

This research was supported by Minsitry of Research and Technology and Higher Education Indonesia.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Budi Santosa .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Santosa, B., Riyanto, O.A.W. (2016). Hybrid Differential Evolution-Variable Neighborhood Search to Solve Multiobjective Hybrid Flowshop Scheduling with Job-Sequence Dependent Setup Time. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2016. Lecture Notes in Computer Science(), vol 9712. Springer, Cham. https://doi.org/10.1007/978-3-319-41000-5_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-41000-5_59

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40999-3

  • Online ISBN: 978-3-319-41000-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics