کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476827 1446074 2012 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Mixed-integer linear programming for resource leveling problems
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Mixed-integer linear programming for resource leveling problems
چکیده انگلیسی

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 “overload 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 Kolisch et al. (1999). Instances with up to 50 activities and tight project deadlines are solved to optimality for the first time.


► We model two resource leveling problems as mixed-integer linear programs.
► We present lower and upper bounds for resource requirements at particular points in time.
► Effective cutting planes are outlined.
► Instances with up to 50 activities and tight project deadlines are solved to optimality for the first time.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 221, Issue 1, 16 August 2012, Pages 27–37
نویسندگان
, , ,