{"id":1034,"date":"2017-11-22T15:22:17","date_gmt":"2017-11-22T14:22:17","guid":{"rendered":"https:\/\/www.hsu-hh.de\/logistik\/?page_id=1034"},"modified":"2017-12-06T10:31:11","modified_gmt":"2017-12-06T09:31:11","slug":"multi-mode-resource-constrained-project-scheduling","status":"publish","type":"page","link":"https:\/\/www.hsu-hh.de\/logistik\/research\/projects\/multi-mode-resource-constrained-project-scheduling","title":{"rendered":"Multi-Mode Resource-Constrained Project Scheduling"},"content":{"rendered":"

The multi-mode resource constrained project scheduling problem (MRCPSP) is an important planning problem with applications in project management, production, and others. There is a number of activities to be scheduled, each of which comes with a set of execution modes of different duration and resource consumptions. In essence, the problem is twofold: select, for each activitiy, an execution mode, and subsequently schedule all activities such that the total duration of the project, i.e., the finish time of the last activitiy, is minimized. Obviously, resource constraints have to be respected, and therefore, and depending on those constraints, not all choices of execution modes are feasible. In fact, and in the general case, even finding a feasible mode assignment is a hard (sub-)problem.<\/p>\n

MISTA 2013 Challenge<\/h3>\n

In 2013, we have contributed to the MISTA 2013 Challenge<\/em>, an implementation competition on the Resource-Constrained Multi-Mode Multi-Project Scheduling Problem. The problem definition is rather close to the MRCPSP, as several projects have to be scheduled at once, and thus presents a generalization of the classical MRCPSP. A detailed description of the problem, incl. the (new) benchmark instances which have been created for this event, is available on the\u00a0competition website.<\/p>\n

Our algorithm combines ideas from Iterated Local Search with Variable Neighborhood Search into a running optimization system. Particular emphasis has been put on a efficient parallel\/multi-threaded implementation. A detailed description of the approach, incl. the source-code of our implementation, have been published.<\/p>\n

In this international competition, our approach ranked\u00a0first<\/a> in the qualification phase held from January 2013\u2013April 2013) and\u00a0second in the finals\/ overall<\/a> (held from April 2013\u2013June 2013).<\/p>\n

\"MISTA2013\"
From left to right: Martin Josef Geiger, sponsor representative, Tony Wauters<\/figcaption><\/figure>\n

Applications to other benchmark instances (MMLIB50, MMLIB100, MMLIB+)<\/h3>\n

Recently, we did run the computer program of the MISTA 2013 Challenge on the MMLIB50, MMLIB100, and MMLIB+ benchmark instances of Van Peteghem and Vanhoucke (see\u00a0http:\/\/www.projectmanagement.UGent.be<\/a>). To our surprise and satisfaction, numerous best known results have been found, which can be downloaded from here<\/a>.<\/p>\n

The success of our work on the MMLIB-data sets gave rise for a joint project with Christian St\u00fcrck and Patrick Gerhards, both of who also contributed to the MRCPSP in the past. In a joint effort, numerous improved solutions have been computed for the MMLIB-instances, see\u00a0http:\/\/www.mmlib.eu\/<\/a>. In fact, most of the best-known-solutions are, at the moment, based on our work.<\/strong><\/p>\n

Related key publications<\/h3>\n

\"EJORMartin Josef Geiger (2017):\u00a0
\nA multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi-project scheduling problem.<\/strong>
\nEuropean Journal of Operational Research, Volume 256, Issue 3, February 2017, Pages 729\u2013741, ISSN 0377-2217.
\n[doi:10.1016\/j.ejor.2016.07.024<\/a>]<\/p>\n

\n

\"MendeleyMartin Josef Geiger:
\nMISTA 2013 Challenge \u2013 sourcecode of my contribution<\/strong>.
\n[doi:10.17632\/cw95t56hjv.1<\/a>]<\/p>\n","protected":false},"excerpt":{"rendered":"

The multi-mode resource constrained project scheduling problem (MRCPSP) is an important planning problem with applications in project management, production, and others. There is a number of activities to be scheduled, […]<\/p>\n","protected":false},"author":74,"featured_media":0,"parent":644,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[53],"tags":[],"class_list":["post-1034","page","type-page","status-publish","hentry","category-research-project"],"_links":{"self":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/1034","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/users\/74"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/comments?post=1034"}],"version-history":[{"count":18,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/1034\/revisions"}],"predecessor-version":[{"id":1324,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/1034\/revisions\/1324"}],"up":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/644"}],"wp:attachment":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/media?parent=1034"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/categories?post=1034"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/tags?post=1034"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}