Skip to main content
SpringerLink
Log in

Critical Path Problem for Scheduling Using Genetic Algorithm

  • Conference paper
  • First Online:
Soft Computing: Theories and Applications

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

Abstract

The critical path problem, in Software Project Management, finds the longest path in a Directed Acyclic Graph. The problem is immensely important for scheduling the critical activities. The problem reduces to the longest path problem, which is NP as against the shortest path problem. The longest path is an important NP-hard problem, which finds its applications in many other areas like graph drawing, sequence alignment algorithms, etc. The problem has been dealt with using Computational Intelligence. The paper presents the state of the art. The applicability of Genetic Algorithms in longest path problem has also been discussed. This paper proposes a novel Genetic Algorithm-based solution to the problem. This algorithm has been implemented and verified using benchmarks. The results are encouraging.

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 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

Institutional subscriptions

References

  1. Bhasin, H.: Algorithm Analysis and Design. Oxford University Press (2015)

    Google Scholar 

  2. Cormen, L., Rivest, S.: Introduction to algorithms. Second Edition, Prentice Hall of India (1990)

    Google Scholar 

  3. Goldberg, D.E.: Genetic algorithms in search, Optimization and Machine Learning. Addison-Wesley, Reading, MA (1989)

    MATH  Google Scholar 

  4. Kitchenham, B.A., Charters, S.: Guidelines for performing systematic literature reviews in software engineering. Technical Report EBSE-2007–01, School of Computer Science and Mathematics, Keele University (2007)

    Google Scholar 

  5. Hardgrave, W.W., Nemhauser, G.L.: On the relation between the traveling-salesman and the longest-path problems. Oper. Res. 10, 647 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bhasin, H., Singla, N.: Harnessing cellular automata and genetic algorithms to solve travelling salesman problem. ICICT, 72–77 (2012)

    Google Scholar 

  7. Ioannidou, K., Mertzios, G.B., Nikolopoulos, G.B.: The longest path problem is polynomial on interval graphs. In: MFCS’09, Springer-Verlag, Berlin, Heidelberg (2009)

    Google Scholar 

  8. Karger, D., Motwani, R., Ramkumar, G.: On approximating the longest path in a graph. Algorithmica 18(1), 82–98 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Uehara, R., Uno, Y.: Efficient algorithms for the longest path problem. In: ISAAC (2004)

    Google Scholar 

  10. Uehara, R., Valiente, G.: Linear structure of bipartite permutation graphs and the longest path problem. Inf. Process. Lett. 103(2), 71–77 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ghosh, E.: Hamiltonicity and longest path problem on special classes of graphs. Research Thesis, Indian Institute of Technology, Madras (2011)

    Google Scholar 

  12. Ioannidou, K., Nikolopoulos, S.D.: The longest path problem is polynomial on cocomparability graphs. Lect. Notes Comput. Sci. Springer 6410, 27–38

    Google Scholar 

  13. Bhasin, H., Ahuja, G.: Harnessing genetic algorithm for vertex cover problem. IJCSE (2012)

    Google Scholar 

  14. Bhasin, H., Singla, N.: Genetic based algorithm for N-puzzle problem. Int. J. Comput. Appl. 51(22) (2012)

    Google Scholar 

  15. Bhasin, H., Mahajan, R.: Genetic algorithms based solution to maximum clique problem, Int. J. Comput. Sci. Eng. 4(8) (2012)

    Google Scholar 

  16. Bhasin, H., Behal, G., Aggarwal, N., Saini, R.K., Choudhary, S.: On the applicability of diploid genetic algorithms in dynamic environments. Soft Computing, 1–8. Springer (2015)

    Google Scholar 

  17. Karp, R.: Reducibility among combinatorial problems. Complexity of computer computations. In: Miller, R., Thatcher, J. (eds.) Plenum Press pp. 85–103 (1970)

    Google Scholar 

  18. Senior, B.A.: Critical Path Method Implementation Drawbacks: A Discussion Using Action Theory

    Google Scholar 

  19. Suderman, M.: Layered Graph Drawing. ACM, McGill University, Montreal, Quebue, Canada (2005)

    Google Scholar 

  20. Attwood, T.K., et al.: Introduction to Bioinformatics. Pearson Publications (2009)

    Google Scholar 

  21. Bhasin et al., H.: On the applicability of Diploid Genetic Algorithm. AI and society. Springer 31(2), 265–274 (2016)

    Article  Google Scholar 

  22. Bhasin, H., et al.: On the applicability of Diploid Genetic Algorithm in Dynamic Environments. Soft Computing, Springer, First Online, 1–10 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, India

    Harsh Bhasin

  2. Department of Computer Science, YMCA University of Science and Technology, Faridabad, India

    Nandeesh Gupta

Authors
  1. Harsh Bhasin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nandeesh Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harsh Bhasin .

Editor information

Editors and Affiliations

  1. Department of Applied Science and Engineering, IIT Roorkee, Saharanpur, India

    Millie Pant

  2. Department of Physics, Amity School of Applied Sciences, Amity University Rajasthan, Jaipur, Rajasthan, India

    Kanad Ray

  3. Department of Computer Science and Engineering, Amity School of Engineering and Technology, Amity University Rajasthan, Jaipur, Rajasthan, India

    Tarun K. Sharma

  4. Department of Electronics and Communication Engineering, SEEC, Manipal University Jaipur, Jaipur, Rajasthan, India

    Sanyog Rawat

  5. Surface Characterization Group, NIMS, Nano Characterization Unit, Advanced Key Technologies Division, Tsukuba, Ibaraki, Japan

    Anirban Bandyopadhyay

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

Bhasin, H., Gupta, N. (2018). Critical Path Problem for Scheduling Using Genetic Algorithm. In: Pant, M., Ray, K., Sharma, T., Rawat, S., Bandyopadhyay, A. (eds) Soft Computing: Theories and Applications. Advances in Intelligent Systems and Computing, vol 583. Springer, Singapore. https://doi.org/10.1007/978-981-10-5687-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5687-1_2

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5686-4

  • Online ISBN: 978-981-10-5687-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation