A mixed-integer programming-based heuristic for project scheduling with work-content constraints

Zimmermann, Adrian (2017). A mixed-integer programming-based heuristic for project scheduling with work-content constraints. European journal of industrial engineering, 11(6), pp. 752-773. Inderscience Publishers 10.1504/EJIE.2017.10006712

Full text not available from this repository. (Request a copy)

We consider the project scheduling problem in which each project activity has a prescribed work content that must be completed by a so-called work-content resource and the activities' resource usage may change over time. The resource usage must lie within prescribed bounds and cannot be changed for a minimum number of consecutive periods. The amount of resource units used determines the requirements for further resources. The activities must be scheduled such that the project makespan is minimised. For this problem, we devise a mixed-integer programming-based heuristic that schedules the activities iteratively. To improve the resource usage for multiple activities simultaneously, subsets of activities are rescheduled each time the activities' resource usage appears to be inefficient. Our computational results for a standard test set from the literature show that our heuristic outperforms the state-of-the-art method for medium- and large-sized instances, and that for many small-sized instances, optimal solutions are obtained.

Item Type:

Journal Article (Original Article)


03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Zimmermann, Adrian


600 Technology > 650 Management & public relations




Inderscience Publishers




Juliana Kathrin Moser-Zurbrügg

Date Deposited:

04 Apr 2018 11:00

Last Modified:

28 Jan 2020 13:49

Publisher DOI:




Actions (login required)

Edit item Edit item
Provide Feedback