An adaptive large neighbourhood search as a matheuristic for the multi-mode resource-constrained project scheduling problem
by Patrick Gerhards; Christian Stürck; Andreas Fink
European J. of Industrial Engineering (EJIE), Vol. 11, No. 6, 2017

Abstract: The multi-mode resource-constrained project scheduling problem is a well-known problem in the field of scheduling. The objective of the problem is to find the minimum makespan for the project. Hence, each activity has to be assigned to a mode and a starting time. At the same time, precedence and resource constraints must not be violated. We present a hybrid approach which combines an adaptive large neighbourhood search with mixed integer programming. We applied the procedure to datasets from the MMLIB library with up to 100 activities and nine modes. The computational results show that the approach is competitive with other state-of-the-art heuristics. Moreover, it found 294 new best known solutions and outperformed all other published methods on the MMLIB+ dataset. [Received 30 September 2016; Revised 6 April 2017; Accepted 26 April 2017]

Online publication date: Fri, 05-Jan-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com