Skip to main content

Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm

  • Conference paper
Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 289))

Abstract

This paper analyses the application of the Chaos driven Discrete Artificial Bee Algorithm to the flowshop with zero intermediate storage problem. Nine unique chaos maps are embedded in the Discrete Artificial Bee Algorithm alongside the Mersenne twister and evaluated on the Taillard problem sets for the total flowtime criterion. Based on the obtained results and statistical analysis, it is shown that a number of chaos driven algorithms significantly performed better than the Mersenne Twister variant.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Alatas, B., Akin, E., Ozer, A.: Chaos embedded particle swarm optimization algorithms. Chaos, Solitons and Fractals 40(4), 1715–1734 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Caponetto, R., Fortuna, L., Fazzino, S., Xibilia, M.: Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7(3), 289–304 (2003)

    Article  Google Scholar 

  3. Chang, J.H., Chiu, H.N.: A comprehensive review of lot streaming. International Journal of Production Research 43(8), 1515–1536 (2005)

    Article  Google Scholar 

  4. Davendra, D., Zelinka, I., Senkerik, R., Bialic-Davendra, M.: Chaos driven evolutionary algorithm for the traveling salesman problem. In: Davendra, D. (ed.) Traveling Salesman Problem, Theory and Applications, pp. 55–70. InTech Publishing, Croatia (2010)

    Chapter  Google Scholar 

  5. Davendra, D., Senkerik, R., Zelinka, I., Pluhacek, M., Bialic-Davendra, M.: Utilising the chaos-induced discrete self organising migrating algorithm to solve the lot-streaming flowshop scheduling problem with setup time. Soft Computing (2014), doi:10.1007/s00500-014-1219-7

    Google Scholar 

  6. Davendra, D., Zelinka, I., Senkerik, R.: Chaos driven evolutionary algorithms for the task of pid control. Computers & Mathematics with Applications 60(4), 1088–1104 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  8. Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research, 535–550 (2000)

    Google Scholar 

  9. Hall, N., Sriskandarayah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 510–525 (1996)

    Google Scholar 

  10. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report TR06, Computer Engineering Department, Erciyes University, Turkey (2005)

    Google Scholar 

  11. Karaboga, D., Akay, B.: A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation 214, 108–132 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  12. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (abc) algorithm. Journal of Global Optimization 39, 459–471 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  13. Karaboga, D., Basturk, B.: On the performance of artificial bee colony (abc) algorithm. Applied Soft Computing 8, 687–697 (2008)

    Article  Google Scholar 

  14. Li, J.Q., Pan, Q.K., Tasgetiren, M.F.: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Applied Mathematical Modelling (2013)

    Google Scholar 

  15. Lozi, R.: New enhanced chaotic number generators. Indian Journal of Industrial and Applied Mathematics 1(1), 1–23 (2008)

    MathSciNet  Google Scholar 

  16. Lu, Y., Zhou, J., Qin, H., Wang, Y., Zhang, Y.: Chaotic differential evolution methods for dynamic economic dispatch with valve-point effects. Engineering Applications of Artificial Intelligence 24(2), 378–387 (2011)

    Article  Google Scholar 

  17. Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Transaction on Modeling and Computer Simulation 8(1), 3–30 (1998)

    Article  MATH  Google Scholar 

  18. Ozer, A.B.: Cide: Chaotically initialized differential evolution. Expert Systems with Applications 37(6), 4632–4641 (2010)

    Article  MathSciNet  Google Scholar 

  19. Pan, Q.K., Tasgetiren, M.F., Suganthan, P., Chua, T.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences 181, 2455–2468 (2011)

    Article  MathSciNet  Google Scholar 

  20. Pinedo, M.: Scheduling: theory, algorithms and systems. Prentice Hall, Inc., New Jersey (1995)

    MATH  Google Scholar 

  21. Pluhacek, M., Senkerik, R., Davendra, D., Kominkova Oplatkova, Z., Zelinka, I.: On the behavior and performance of chaos driven pso algorithm with inertia weight. Computers and Mathematics with Applications 66(2), 122–134 (2013)

    Article  MathSciNet  Google Scholar 

  22. Pluhacek, M., Senkerik, R., Zelinka, I., Davendra, D.: Chaos pso algorithm driven alternately by two different chaotic maps-an initial study, pp. 2444–2449 (2013)

    Google Scholar 

  23. Raaymakers, W., Hoogeveen, J.: Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing. European Journal of Operational Research, 131–151 (2000)

    Google Scholar 

  24. Rajendran, C.: A no-wait flowshop scheduling heuristic to minimize makespan. Journal of the Operational Research Society, 472–478 (1994)

    Google Scholar 

  25. Senkerik, R., Pluhacek, M., Davendra, D., Zelinka, I., Kominkova Oplatkova, Z.: Chaos driven evolutionary algorithm: A new approach for evolutionary optimization. International Journal of Mathematics and Computers in Simulation 7(4), 363–368 (2013)

    Google Scholar 

  26. Sprott, J.: Chaos and Time-Series Analysis. Oxford University Press, UK (2003)

    MATH  Google Scholar 

  27. Taillard, E.: Benchmarks for basic scheduling problems. European Journal of Operations Research 64, 278–285 (1993)

    Article  MATH  Google Scholar 

  28. Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Chen, A.: A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Information Sciences 181, 3459–3475 (2011)

    Article  MathSciNet  Google Scholar 

  29. Tasgetiren, M.F., Pan, Q.K., Suganthan, P., Oner, A.: A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion. Applied Mathematical Modelling 37, 6758–6799 (2013)

    Article  MathSciNet  Google Scholar 

  30. Wang, L.: Shop Scheduling with Genetic Algorithms. Tsinghua Univ. Press, Beijing (2003)

    Google Scholar 

  31. Yuan, X., Cao, B., Yang, B., Yuan, Y.: Hydrothermal scheduling using chaotic hybrid differential evolution. Energy Conversion and Management 49(12), 3627–3633 (2008)

    Article  Google Scholar 

  32. Zelinka, I., Chadli, M., Davendra, D., Senkerik, R., Pluhacek, M., Lampinen, J.: Do evolutionary algorithms indeed require random numbers? extended study. Advances in Intelligent Systems and Computing 210, 61–75 (2013)

    Article  Google Scholar 

  33. Zuo, X., Fan, Y.: A chaos search immune algorithm with its application to neuro-fuzzy controller design. Chaos, Solitons and Fractals 30(1), 94–109 (2006)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Magdalena Metlická .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Metlická, M., Davendra, D. (2014). Scheduling the Flowshop with Zero Intermediate Storage Using Chaotic Discrete Artificial Bee Algorithm. In: Zelinka, I., Suganthan, P., Chen, G., Snasel, V., Abraham, A., Rössler, O. (eds) Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems. Advances in Intelligent Systems and Computing, vol 289. Springer, Cham. https://doi.org/10.1007/978-3-319-07401-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07401-6_14

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07400-9

  • Online ISBN: 978-3-319-07401-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics