Skip to main content
SpringerLink
Log in

A Hybrid of Tabu Search and Simulated Annealing Algorithms for Preemptive Project Scheduling Problem

  • Conference paper
  • First Online:
Advances in Artificial Intelligence: From Theory to Practice (IEA/AIE 2017)

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

Abstract

In this paper, the resource constrained project scheduling problem with preemption is studied in which fixed setup time is needed to resume the preempted activities. The project entails activities with finish-to-start precedence relations, which need a set of renewable resources to be done. A mathematical model is presented for the problem and a hybrid of Tabu Search (TS) and Simulated Annealing (SA) with tuned parameters is developed to solve it. In order to evaluate the performance of the proposed TS/SA a set of 100 test problems is applied. Comprehensive statistical analysis shows that the proposed algorithm efficiently solves the problem. Furthermore, the benefits of preemption with setup times and its justifiability is demonstrated numerically.

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

Similar content being viewed by others

References

  1. Blazewicz, J., Lenstra, J., Rinnooy Kan, A.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  2. Hartmann, S., Briskorn, D.A.: Surveys of variants and extensions of the resource constrained project scheduling problem. Eur. J. Oper. Res. 207(1), 1–14 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fang, C., Wang, L.: An effective shuffled frog-learning algorithm for resource constrained project scheduling problem. Comput. Oper. Res. 39(5), 890–901 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kone, O.: New approaches for solving the resource constrained project scheduling problem. 4OR 10(1), 105–106 (2012)

    Article  MathSciNet  Google Scholar 

  5. Paraskevopoulos, D.C., Tarantilis, C.D., Ioannou, G.: Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Syst. Appl. 39(4), 3983–3994 (2012)

    Article  Google Scholar 

  6. Van Peteghem, V., Vanhoucke, M.: A genetic algorithm for the preemptive and non-preemptive multi-mode resource constrained project scheduling problem. Eur. J. Oper. Res. 201(2), 409–418 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Afshar-Nadjafi, B., Majlesi, M.: Resource constrained project scheduling problem with setup times after preemptive processes. Comput. Chem. Eng. 69, 16–25 (2014)

    Article  Google Scholar 

  8. Moukrim, A., Quilliot, A., Toussaint, H.: An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration. Eur. J. Oper. Res. 244, 360–368 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Roshanaei, V., Naderi, B., Jolai, F., Khalili, M.: A variable neighborhood search for job shop scheduling with setup times to minimize makespan. Future Gener. Comput. Syst. 25, 654–661 (2009)

    Article  Google Scholar 

  10. Nagano, M.S., Silva, A.A., Lorena, L.A.N.: A new evolutionary clustering search for a no-wait flow shop problem with setup times. Eng. Appl. Artif. Intell. 25(6), 1114–1120 (2012)

    Article  Google Scholar 

  11. Liao, C.J., Chao, C.W., Chen, L.C.: An improved heuristic for parallel machine weighted flow time scheduling with family setup times. Comput. Math. Appl. 63(1), 110–117 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kolisch, R.: Project Scheduling Under Resource Constraints - Efficient Heuristics for Several Problem Classes. Physica, Heidelberg (1995)

    Book  Google Scholar 

  13. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)

    Book  MATH  Google Scholar 

  14. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  15. Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource constrained project scheduling problem. Eur. J. Oper. Res. 127, 394–407 (2000)

    Article  MATH  Google Scholar 

  16. Pitsoulis, L.S., Resende, M.G.C.: Greedy randomized adaptive search procedure. In: Pardalos, P., Resende, M. (eds.) Handbook of Applied Optimization, pp. 168–183. Oxford University Press, Oxford (2002)

    Google Scholar 

  17. Taguchi, G.: Introduction to Quality Engineering. Asian Productivity Organization, Tokyo (1986)

    Google Scholar 

  18. Drexl, A., Nissen, R., Patterson, J.H., Salewski, F.: ProGen/πx - an instance generator for resource constrained project scheduling problems with partially renewable resources and further extensions. Eur. J. Oper. Res. 125, 59–72 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

    Behrouz Afshar-Nadjafi, Mehdi Yazdani & Mahyar Majlesi

Authors
  1. Behrouz Afshar-Nadjafi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mehdi Yazdani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mahyar Majlesi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Behrouz Afshar-Nadjafi .

Editor information

Editors and Affiliations

  1. Artois University, Lens, France

    Salem Benferhat

  2. Artois University, Lens, France

    Karim Tabia

  3. Texas State University, San Marcos, Texas, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Afshar-Nadjafi, B., Yazdani, M., Majlesi, M. (2017). A Hybrid of Tabu Search and Simulated Annealing Algorithms for Preemptive Project Scheduling Problem. In: Benferhat, S., Tabia, K., Ali, M. (eds) Advances in Artificial Intelligence: From Theory to Practice. IEA/AIE 2017. Lecture Notes in Computer Science(), vol 10350. Springer, Cham. https://doi.org/10.1007/978-3-319-60042-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-60042-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-60041-3

  • Online ISBN: 978-3-319-60042-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation