Skip to main content

A Tabu Search Algorithm for Simultaneous Selection and Scheduling of Projects

  • Conference paper
  • First Online:
Harmony Search and Nature Inspired Optimization Algorithms

Abstract

In this paper, the problem of simultaneous selection and scheduling of projects is considered. Problem considers the time-sensitive profits, interdependencies, fixed planning horizon, and due dates of the projects. A 0–1 integer programing model is presented for the problem. The objective of the model is to maximize the total expected profit from the portfolio. The problem being NP-hard; a solution approach is required to solve the problem optimally in reasonable computational time. Thus, a TS algorithm is developed to solve the problem with a new move strategy. This strategy provides a structured neighborhood, which varies with the size of the problem. The algorithm is applied to three different sizes of the tabu list to find the right setting of tabu length to balance the exploration and exploitation during the search. Computational experiments are used to compare these three forms of the proposed TS algorithm. Fifteen test instances with different complexity levels have been developed to check the performance of the proposed TS algorithm. From the results, it is clear that tabu search is quite promising to solve the problem. Finally, some future directions are suggested for the problem.

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

Access this chapter

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

Similar content being viewed by others

References

  1. Amirian, H., Sahraeian, R.: Solving a grey project selection scheduling using a simulated shuffled frog leaping algorithm. Comput. Ind. Eng. 107, 141–149 (2017)

    Article  Google Scholar 

  2. Chen, J., Askin, R.G.: Project selection, scheduling and resource allocation with time dependent returns. Eur. J. Oper. Res. 193(1), 23–34 (2009)

    Article  Google Scholar 

  3. Coffin, M.A., Taylor, B.W.: Multiple criteria R&D project selection and scheduling using fuzzy logic. Comput. Oper. Res. 23(3), 207–220 (1996)

    Article  Google Scholar 

  4. Coffin, M.A., Taylor III, B.W.: (1996b). R&D project selection and scheduling with a filtered beam search approach. IIE Trans. 28(2), 167–176

    Google Scholar 

  5. Demeulemeester, E.L., Herroelen, W.S.: (2006). Project scheduling: A Research Handbook, vol. 49. Springer

    Google Scholar 

  6. Ghorbani, S., Rabbani, M.: A new multi-objective algorithm for a project selection problem. Adv. Eng. Softw. 40(1), 9–14 (2009)

    Article  Google Scholar 

  7. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986)

    Article  MathSciNet  Google Scholar 

  8. Huang, X., Zhao, T.: Project selection and scheduling with uncertain net income and investment cost. Appl. Math. Comput. 247, 61–71 (2014)

    MathSciNet  MATH  Google Scholar 

  9. Huang, X., Zhao, T., Kudratova, S.: Uncertain mean-variance and mean-semivariance models for optimal project selection and scheduling. Knowl.-Based Syst. 93, 1–11 (2016)

    Article  Google Scholar 

  10. Lambrechts, O., Demeulemeester, E., Herroelen, W.: A tabu search procedure for developing robust predictive project schedules. Int. J. Prod. Econ. 111(2), 493–508 (2008)

    Article  Google Scholar 

  11. Liu, S.S., Wang, C.J.: Optimizing project selection and scheduling problems with time-dependent resource constraints. Autom. Constr. 20(8), 1110–1119 (2011)

    Article  Google Scholar 

  12. Mika, M., Waligora, G., Węglarz, J.: Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. Eur. J. Oper. Res. 187(3), 1238–1250 (2008)

    Article  Google Scholar 

  13. Tofighian, A.A., Naderi, B.: Modeling and solving the project selection and scheduling. Comput. Ind. Eng. 83, 30–38 (2015)

    Article  Google Scholar 

  14. Waligóra, G.: Discrete–continuous project scheduling with discounted cash flows—A tabu search approach. Comput. Oper. Res. 35(7), 2141–2153 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manish Kumar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumar, M., Mittal, M.L., Soni, G., Joshi, D. (2019). A Tabu Search Algorithm for Simultaneous Selection and Scheduling of Projects. In: Yadav, N., Yadav, A., Bansal, J., Deep, K., Kim, J. (eds) Harmony Search and Nature Inspired Optimization Algorithms. Advances in Intelligent Systems and Computing, vol 741. Springer, Singapore. https://doi.org/10.1007/978-981-13-0761-4_104

Download citation

Publish with us

Policies and ethics