Skip to main content
Springer Nature Link
Log in

A Differential Evolution Approach for NTJ-NFSSP with SDSTs and RDs

  • Conference paper
Intelligent Computing Theories and Applications (ICIC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7390))

Included in the following conference series:

Abstract

In this paper, an efficient differential evolution approach, namely DE_NTJ, is presented to minimize the number of tardy jobs (NTJ) for the no-wait flow-shop scheduling problem (NFSSP) with sequence-dependent setup times (SDSTs) and release dates (RDs), which is a complex problem and can be abbreviated as NTJ-NFSSP with SDSTs and RDs. To balance the exploration and exploitation abilities of our DE_NTJ, DE-based global search is utilized to obtain the promising regions or solutions over the solution space, and a local search based on the interchange-based neighborhood and problem’s properties is developed to exploit the neighborhoods from these regions. Simulation results based on a set of random instances show the superiority of DE_NTJ in terms of searching quality, efficiency, and robustness.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Jin, F., Song, S.J., Wu, C.: A Simulated Annealing Algorithm for Single Machine Scheduling Problems with Family Setups. Computers & Operations Research 36(7), 2133–2138 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Rajendran, C.: A no-wait Flowshop Scheduling Heuristic to Minimize Makespan. Journal of the Operational Research Society 45(4), 472–478 (1994)

    MATH  Google Scholar 

  3. Hall, N.G., Sriskandarayah, C.: A Survey of Machine Scheduling Problems with Blocking and no-wait in Process. Operations Research 44(3), 510–525 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Raaymakers, W.H.M., Hoogeveen, J.A.: Scheduling Multipurpose Batch Process Industries with no-wait Restrictions by Simulated Annealing. European Journal of Operational Research 126(1), 131–151 (2000)

    Article  MATH  Google Scholar 

  5. Allahverdi, A., Gupta, J.N.D., Aldowaisan, T.: A Review of Scheduling Research involving Setup Considerations. Omega-Int. J. Manage. S. 27(2), 219–239 (1999)

    Article  Google Scholar 

  6. Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A Survey of Scheduling Problems with Setup Times or Costs. European Journal of Operational Research 187(3), 985–1032 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 2nd edn. Prentice-Hall (2005)

    Google Scholar 

  8. Storn, R., Price, K.: Differential Evolution–a Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. Journal of Global Optimization 11(4), 341–359 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G.: Differential Evolution Algorithm for Permutation Flowshop Sequencing Problem with Makespan Criterion. In: Proceedings of 4th International Symposium on Intelligent Manufacturing Systems, Sakarya, Turkey, pp. 442–452 (2004)

    Google Scholar 

  10. Nearchou, A.C.: A Differential Evolution Approach for the Common Due Date Early/Tardy Job Scheduling Problem. Computers & Operations Research 35(4), 1329–1343 (2008)

    Article  MATH  Google Scholar 

  11. Qian, B., Wang, L., Hu, R., Huang, D.X., Wang, X.: A DE-based Approach to no-wait Flow-shop Scheduling. Computers & Industrial Engineering 57(3), 787–805 (2009)

    Article  Google Scholar 

  12. Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A Discrete Differential Evolution Algorithm for the Permutation Flowshop Scheduling Problem. Computers & Industrial Engineering 55(4), 795–816 (2008)

    Article  Google Scholar 

  13. Qian, B., Zhou, H.B., Hu, R., Xiang, F.H.: Hybrid Differential Evolution Optimization for No-wait Flow-shop Scheduling with Sequence-dependent Setup Times and Release Dates. In: Huang, D.-S., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds.) ICIC 2011. LNCS, vol. 6838, pp. 600–611. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Qian, B., Wang, L., Hu, R., Wang, W.L., Huang, D.X., Wang, X.: A Hybrid Differential Evolution for Permutation Flow-shop Scheduling. International Journal of Advanced Manufacturing Technology 38(7-8), 757–777 (2008)

    Article  Google Scholar 

  15. Price, K., Storn, R.: Differential Evolution (DE) for Continuous Function Optimization (2012), http://www.icsi.berkeley.edu/%7Estorn/code.html

  16. Ruiz, R., Stützle, T.: An Iterated Greedy Heuristic for the Sequence Dependent Setup Times Flowshop Problem with Makespan and Weighted Tardiness Objectives. European Journal of Operational Research 187(3), 1143–1159 (2008)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Automation, Kunming University of Science and Technology, Kunming, 650500, China

    Rong Hu, Xianghu Meng, Bin Qian & Kun Li

Authors
  1. Rong Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xianghu Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Kun Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Electronics and Information Engineering, Machine Learning and Systems Biology Laboratory, Tongji University, 4800 Caoan Road, 201804, Shanghai, China

    De-Shuang Huang

  2. Faculty of Computer and Information Sciences, Hosei University, 3-7-2, Kajino-Cho, Koganei-Shi, Japan

    Jianhua Ma

  3. School of Electrical Engineering, University of Ulsan, #7-413, San 29, Muger Dong, 680-749, Ulsan, South Korea

    Kang-Hyun Jo

  4. Department of Biotechnology, Indian Institute of Technology (IIT) Madras, 600 036, Chennai, Tamilnadu, India

    M. Michael Gromiha

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, R., Meng, X., Qian, B., Li, K. (2012). A Differential Evolution Approach for NTJ-NFSSP with SDSTs and RDs. In: Huang, DS., Ma, J., Jo, KH., Gromiha, M.M. (eds) Intelligent Computing Theories and Applications. ICIC 2012. Lecture Notes in Computer Science(), vol 7390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31576-3_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31576-3_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31575-6

  • Online ISBN: 978-3-642-31576-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics