Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.


Download BibTeX


Overview and State of the Art


[ 1 ] Instytut Informatyki, Wydział Informatyki, Politechnika Poznańska | [ P ] employee

Year of publication


Chapter type

chapter in monograph

Publication language


  • Exact approaches
  • Heuristics
  • Lower bounds
  • Multi mode
  • Project scheduling
  • Resource constraints

EN In this chapter we present a state-of-the-art in the area of multi-mode project scheduling problems. These problems are characterized by the fact that each activity of a project can be executed in one of several modes, representing a relation between the resource requirements of the activity and its duration. In the overview we present the models and solution approaches that have been proposed in the literature across the class of multi-mode project scheduling problems up to now. Firstly we deal with the basic multi-mode resource-constrained project scheduling problems with the objective to minimize the project duration. We present the mixed-integer linear programming formulations of the problem, describe the exact approaches, the existing methods for lower bounds calculation, as well as heuristic approaches to solve the problem. Secondly, we also discuss special cases and extensions of the basic problem. Finally, we analyze multi-mode problems with other objectives, distinguishing between financial and resource-based objectives.

Pages (from - to)

445 - 490





Handbook on Project Management and Scheduling. Vol.1

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.