Skip to main content
SpringerLink
Log in

Minimizing the Total Flow Time for Lot Streaming Flow Shop Using an Effective Discrete Harmony Search Algorithm

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2011)

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

Included in the following conference series:

  • 3411 Accesses

Abstract

This paper presents a discrete harmony search(DHS) algorithm for solving an n-job,m-machine lot-streaming flowshop scheduling problem(LFSP) with equal-size sublots, the objective is to minimize the total flow time. In the proposed DHS algorithm, The discrete job permutation without any conversion is used in the proposed DHS algorithm. To search for the best sequence,the DHS algorithm uses an effective initialization approach and a novel improvisation strategy. At the same time, an effective local search is embedded .Computational results demonstrate that the proposed DHS algorithm is very effectiveness for the lot-streaming flowshop scheduling problem.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Reiter, S.: A System for Managing Job Shop Production. J. Business 34, 371–393 (1966)

    Article  Google Scholar 

  2. Potts, C.N., Baker, K.K.: Flow Shop Scheduling with Lot Streaming. Operation Research Letters 8, 297–303 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  3. Marimuthu, S., Ponnambalam, S.G., Jawahar, N.: Evolutionary Algorithms for Scheduling M-machine Flow Shop with Lot Streaming. Robot Comput. Integr. Manuf. 24, 125–139 (2008)

    Article  Google Scholar 

  4. Tseng, C.T., Liao, C.J.: A Discrete Particle Swarm Optimization for Lot-streaming Flowshop Scheduling Problem. European Journal of Operation Research 191, 360–373 (2008)

    Article  MATH  Google Scholar 

  5. Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A Discrete Particle Swarm Optimization Algorithm for the No-wait Flowshop Scheduling Problem. Computers and Operations Research 35, 2807–2839 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Marimuthu, S., Ponnambalam, S.G., Jawahar, N.: Threshold Accepting and Ant-colony Optimization Algorithm for Scheduling M-machine Flow Shop with Lot Streaming. J. Mater. Process. Technol. 209, 1026–1041 (2009)

    Article  Google Scholar 

  7. Pan, Q.K., Suganthan, P.N., Tasgetiren, M.F., Chua, T.J.: A Novel Artificial Bee Colony Algorithm for a Lot-streaming Flow Shop Scheduling Problem. Information Sciences 181, 2455–2468 (2011)

    Article  MathSciNet  Google Scholar 

  8. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. Simulation 76, 60–68 (2001)

    Article  Google Scholar 

  9. Lee, K.S., Geem, Z.W., Lee, S.H., Bae, K.W.: The harmony search heuristic algorithm for discrete structural optimization. Eng. Optim. 37, 663–684 (2005)

    Article  MathSciNet  Google Scholar 

  10. Mahdavi, M., Fesanghary, M., Damangir, E.: An Improved Harmony Search Algorithm for Solving Optimization Problems. Appl. Math. Comput. 188(3), 1567–1579 (2007)

    MathSciNet  MATH  Google Scholar 

  11. Geem, Z.W., Lee, K.S., Park, Y.: Application of Harmony Search to Vehicle Routing. Am. J. Appl. Sci. 2, 1552–1557 (2005)

    Article  Google Scholar 

  12. Geem, Z.W.: Optimal Cost Design of Water Distribution Networks using Harmony Search. Eng. Optim. 38, 259–280 (2006)

    Article  Google Scholar 

  13. Zarei, O., Fesanghary, M., Farshi, B., Saffar, R.J., Rafar, M.R.: Optimization of Multi-pass Face-milling via Harmony Search Algorithm. J. Mater. Process. Technol. 209, 2386–2392 (2009)

    Article  Google Scholar 

  14. Coelho, L.S., Bernert, D.L.A.: An Improved Harmony Search Algorithm for Synchronization of Discrete-time Chaotic System. Chaos Soliton Fract. 41, 2526–2532 (2009)

    Article  MATH  Google Scholar 

  15. Wang, L., Pan, Q.K., Tasgetiren, M.F.: Minimizing the Total Flow Time in a Flow Shop with Blocking by Using Hybrid Harmony Search Slgorithms. Expert Syst. Appl. 37(3), 7929–7936 (2010)

    Article  Google Scholar 

  16. Pan, Q., Suganthan, P.N., Tasgetiren, M.F.: A Self-Adaptive Global Best Harmony Search Algorithm for Continuous Optimization Problems. Applied Mathematics and Computation 206(3), 830–848 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pan, Q., Suganthan, P.N., Liang, J.J., Tasgetiren, M.F.: A Local-best Harmony Search Algorithm with Dynamic Sub-harmony Memories for Lot-streaming Flow Shop Scheduling Problem. Expert Systems With Applications 38(4), 3252–3259 (2011)

    Article  Google Scholar 

  18. Pan, Q., Suganthan, P.N.: A Local-best Harmony Search Algorithm with Dynamic Neighborhood. Engineering Optimization 42(3), 101–117 (2010)

    Article  Google Scholar 

  19. Nawaz, M., Enscore, J.: A Heuristic Algorithm for the M-machine, N-job Flow Shop Sequencing Problem. Omega 11, 91–95 (1983)

    Article  Google Scholar 

  20. Mahamed, G.H.: Global-best Harmony Search. Applied Mathematics and Computation 198(3), 643–656 (2008)

    MathSciNet  MATH  Google Scholar 

  21. Cheng, Y.M.: An Improved Harmony Search Minimization Algorithm Using Different Slip Surface Generation Methods for Slope Stability Analysis. Engineering Optimization 40(3), 95–115 (2008)

    Article  Google Scholar 

  22. Mahdavi, M.: An Improved Harmony Search Algorithm for Solving Optimization Problems. Applied Mathematics and Computation 188(3), 1567–1579 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Wang, L.: A Novel Hybrid Discrete Differential Evolution Algorithm for Blocking Flow Shop Scheduling Problems. Computers and Operations Research 37(7), 509–520 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics Science, Liaocheng University, Liaocheng, 252059, China

    Hong-Yan Han

Authors
  1. Hong-Yan Han
    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, Tongji University, 4800 Caoan Road, 201804, Shanghai, China

    De-Shuang Huang

  2. School of Computer and Communication Engineering, Zhengzhou University of Light Industry, No. 5, Dongfeng Road, Jinshui District, 450002, Zhengzhou, Henan, China

    Yong Gan

  3. Indian Institute of Technology Kanpur, 208016, Kanpur, India

    Phalguni Gupta

  4. Department of Biotechnology, Indian Institute of Technology 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

Han, HY. (2012). Minimizing the Total Flow Time for Lot Streaming Flow Shop Using an Effective Discrete Harmony Search Algorithm. In: Huang, DS., Gan, Y., Gupta, P., Gromiha, M.M. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2011. Lecture Notes in Computer Science(), vol 6839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25944-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25944-9_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25943-2

  • Online ISBN: 978-3-642-25944-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation