Mixed-integer linear programming for resource leveling problems
- 作者：Julia Rieck ; julia.rieck@tu-clausthal.de ; Jü ; rgen Zimmermann juergen.zimmermann@tu-clausthal.de ; Thorsten Gather
- 关键词：Project scheduling ; Resource leveling ; Minimum and maximum time lags ; Lower and upper bounds ; Cutting planes
- 刊名：European Journal of Operational Research
- 出版年：2012
- 期刊代码：58_03772217
- 类别：et
- 出版时间：16 August, 2012
- 卷：221
- 期：1
- 页码：27-37
- 文件大小：425 K
摘要
We consider project scheduling problems subject to general temporal constraints, where the utilization of a set of renewable resources has to be smoothed over a prescribed planning horizon. In particular, we consider the classical resource leveling problem, where the variation in resource utilization during project execution is to be minimized, and the so-called 鈥渙verload problem鈥? where costs are incurred if a given resource-utilization threshold is exceeded. For both problems, we present new mixed-integer linear model formulations and domain-reducing preprocessing techniques. In order to strengthen the models, lower and upper bounds for resource requirements at particular points in time, as well as effective cutting planes, are outlined. We use CPLEX 12.1 to solve medium-scale instances, as well as instances of the well-known test set devised by . Instances with up to 50 activities and tight project deadlines are solved to optimality for the first time.