Skip to main content

Optimization Technique for Flowshop Scheduling Problem

  • Conference paper
  • First Online:
  • 1227 Accesses

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

Abstract

This paper presents a novel approach for solving flowshop scheduling problem with the objective of minimizing the makespan and maximizes the machine utilization with the help of optimization techniques. Flowshop is used for allocation of resources among the tasks to complete their scheduling process with optimization technique to get a feasible solution. This paper illustrates a proposed method with example and compared with traditional algorithms.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. J. Andro-Vasko, Shop problems in scheduling (University of Nevada, Las Vegas, 2011)

    Google Scholar 

  2. M. Drozdowski, Scheduling multiprocessor tasks- an overview. Eur. J. Oper. Res. 94 (1996)

    Google Scholar 

  3. A. Jukuntla, G.M. Kanaga, Flowshop Scheduling using multiagents with adaptive auction. Int. J. Comput. Eng. Res. 3(3) (2013)

    Google Scholar 

  4. H. Ishibuchi, T Murata, A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics Society, vol. 28, no. 3 (1998)

    Google Scholar 

  5. D. Karaboga, An idea based on honey bee swarm for numerical optimization. Technical Report-TR06, Erciyes University, vol. 200 (2010)

    Google Scholar 

  6. D. Karaboga, B. Akay, A comparative study of artificial bee colony algorithn. Appl. Math. Comput. 214(1), 2009 (2009)

    MATH  Google Scholar 

  7. E. Zitzler, L. Thiele, in Multiobjective Evolutionary Algorithms: A comparative Case Study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, Vol. 3, No. 4, November 1999

    Google Scholar 

  8. J. Amar, P. Keerthi, N. Arjun, in SAWR: Scheduling Algorithm for WSN with Rendezvous Nodes. 2015 IEEE International Conference on Computational Intelligence and Computing Research, 10–12 Dec 2015

    Google Scholar 

  9. H.C. Lau, Multi-period combinatorial auction mechanism for distributed resource allocation and scheduling. in Proceedings International Conference Intelligent Agent Technology, pp. 407–411

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amar Jukuntla .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jukuntla, A. (2018). Optimization Technique for Flowshop Scheduling Problem. In: Dash, S., Naidu, P., Bayindir, R., Das, S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 668. Springer, Singapore. https://doi.org/10.1007/978-981-10-7868-2_18

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7868-2_18

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7867-5

  • Online ISBN: 978-981-10-7868-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics