Skip to main content
Top

2012 | OriginalPaper | Chapter

A Novel Learning Algorithm Based on a Multi-Agent Structure for Solving Multi-Mode Resource-Constrained Project Scheduling Problem

Authors : Omid Mirzaei, Mohammad-R. Akbarzadeh-T.

Published in: Computer Science and its Applications

Publisher: Springer Netherlands

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The resource-constrained project scheduling problem (RCPSP) includes activities which have to be scheduled due to precedence and resource restrictions such that an objective is satisfied. There are several variants of this problem currently, and also different objectives are considered with regards to the specific applications. This paper tries to introduce a new multi-agent learning algorithm (MALA) for solving the multi-mode resource-constrained project scheduling problem (MMRCPSP), in which the activities of the project can be performed in multiple execution modes. This work aims to minimize the total project duration which is referred to its makespan. The experimental results show that our method is a new one for this specific problem and can outperform other algorithms in different areas.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)MathSciNetMATHCrossRef Blazewicz, J., Lenstra, J.K., Kan, A.H.G.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11–24 (1983)MathSciNetMATHCrossRef
2.
go back to reference Mika M, Waligora G, Weeglarz J.: Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. Eur. J. Oper. Res. 164(3 SPEC), 639–668 (2005) Mika M, Waligora G, Weeglarz J.: Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. Eur. J. Oper. Res. 164(3 SPEC), 639–668 (2005)
3.
go back to reference Slowinski, R., Soniewicki, B., Weglarz, J.: DSS for multi objective project scheduling. Eur. J. Oper. Res. 79, 220–229 (1994)MATHCrossRef Slowinski, R., Soniewicki, B., Weglarz, J.: DSS for multi objective project scheduling. Eur. J. Oper. Res. 79, 220–229 (1994)MATHCrossRef
4.
go back to reference Hartmann, S., Drexl, A.: Project scheduling with multiple modes. A comparison of exact algorithms. Networks 32(4), 283–297 (1998)MathSciNetMATHCrossRef Hartmann, S., Drexl, A.: Project scheduling with multiple modes. A comparison of exact algorithms. Networks 32(4), 283–297 (1998)MathSciNetMATHCrossRef
5.
go back to reference Wauters, T., Verbeeck, K.: Vanden Berghe G, De Causmaecher P.: Learning agents for the multi-mode project scheduling problem. J Oper Res Soc 62, 281–290 (2011)CrossRef Wauters, T., Verbeeck, K.: Vanden Berghe G, De Causmaecher P.: Learning agents for the multi-mode project scheduling problem. J Oper Res Soc 62, 281–290 (2011)CrossRef
7.
go back to reference Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res. 149(2), 268–281 (2003)MathSciNetMATHCrossRef Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res. 149(2), 268–281 (2003)MathSciNetMATHCrossRef
8.
go back to reference Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6, 333–346 (2002)CrossRef Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6, 333–346 (2002)CrossRef
9.
go back to reference Ziarati, K., Akbari, R., Zeighami, V.: On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput J 11(4), 3720–3733 (2011)CrossRef Ziarati, K., Akbari, R., Zeighami, V.: On the performance of bee algorithms for resource-constrained project scheduling problem. Appl Soft Comput J 11(4), 3720–3733 (2011)CrossRef
10.
go back to reference Valls, V., Quintanilla, M. S., Ballestin, F.: Resource-constrained project scheduling: a critical activity reordering heuristic. Eur. J. Oper. Res. Forthcoming (2004) Valls, V., Quintanilla, M. S., Ballestin, F.: Resource-constrained project scheduling: a critical activity reordering heuristic. Eur. J. Oper. Res. Forthcoming (2004)
11.
go back to reference Debels D, Reyck B. De, Leus R, Vanhoucke M.: A hybrid scatter search/Electromagnetism meta–heuristic for project scheduling. Eur. J. Oper. Res. To appear (2004) Debels D, Reyck B. De, Leus R, Vanhoucke M.: A hybrid scatter search/Electromagnetism meta–heuristic for project scheduling. Eur. J. Oper. Res. To appear (2004)
12.
go back to reference Kelley Jr, J.E.: The critical-path method: resources planning and scheduling. In: Industrial Scheduling. Prentice-Hall, New Jersey, pp. 347–365 (1963) Kelley Jr, J.E.: The critical-path method: resources planning and scheduling. In: Industrial Scheduling. Prentice-Hall, New Jersey, pp. 347–365 (1963)
13.
go back to reference Bedworth, D., Bailey, J.: Integrated production control systems management, analysis design. Wiley, New York (1982) Bedworth, D., Bailey, J.: Integrated production control systems management, analysis design. Wiley, New York (1982)
14.
go back to reference Verbeeck, K., Nowe,´ A., Vrancx, P., Peeters, M.: Reinforcement learning theory and applications. Multi-automata learning, Chapter 9. I-Tech Education and Publishing: Vienna, pp 167–185 (2008) Verbeeck, K., Nowe,´ A., Vrancx, P., Peeters, M.: Reinforcement learning theory and applications. Multi-automata learning, Chapter 9. I-Tech Education and Publishing: Vienna, pp 167–185 (2008)
16.
go back to reference Jarboui, B., Damak, N., Siarry, P., Rebai, A.: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195(1), 299–308 (2008)MathSciNetMATHCrossRef Jarboui, B., Damak, N., Siarry, P., Rebai, A.: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl. Math. Comput. 195(1), 299–308 (2008)MathSciNetMATHCrossRef
17.
go back to reference Lova, A., Tormos, P., Cervantes, M., Barber, F.: An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int. J. Prod. Econ. 117(2), 302–316 (2009)CrossRef Lova, A., Tormos, P., Cervantes, M., Barber, F.: An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. Int. J. Prod. Econ. 117(2), 302–316 (2009)CrossRef
18.
go back to reference Hartmann, S.: Packing problems and project scheduling models: an integrating perspective. J Oper Res Soc 51, 1083–1092 (2000)MATH Hartmann, S.: Packing problems and project scheduling models: an integrating perspective. J Oper Res Soc 51, 1083–1092 (2000)MATH
19.
go back to reference Jedrzejowicz P, Ratajczak-Ropel E.: Solving the RCPSP/max problem by the team of agents. In: Agent and Multi-Agent Systems: Technologies and Applications, Lecture Notes in Computer Science, Volume 5559/2009, pp. 734–743 (2009) Jedrzejowicz P, Ratajczak-Ropel E.: Solving the RCPSP/max problem by the team of agents. In: Agent and Multi-Agent Systems: Technologies and Applications, Lecture Notes in Computer Science, Volume 5559/2009, pp. 734–743 (2009)
Metadata
Title
A Novel Learning Algorithm Based on a Multi-Agent Structure for Solving Multi-Mode Resource-Constrained Project Scheduling Problem
Authors
Omid Mirzaei
Mohammad-R. Akbarzadeh-T.
Copyright Year
2012
Publisher
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-007-5699-1_24

Premium Partner