A Branch and Bound Approach to Solve the Preemptive Resource Leveling Problem | Zendy

Behrouz Afshar-Nadjafi | Zendy; zeinab khalaj | Zendy; Esmaeil Mehdizadeh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Branch and Bound Approach to Solve the Preemptive Resource Leveling Problem

Author(s) -

Behrouz Afshar-Nadjafi,

zeinab khalaj,

Esmaeil Mehdizadeh

Publication year - 2013

Publication title -

international journal of manufacturing engineering

Language(s) - English

Resource type - Journals

eISSN - 2356-7023

pISSN - 2314-5781

DOI - 10.1155/2013/930920

Subject(s) - preemption , computer science , branch and bound , mathematical optimization , coding (social sciences) , scheduling (production processes) , resource leveling , resource (disambiguation) , resource constraints , matlab , function (biology) , job shop scheduling , upper and lower bounds , resource allocation , algorithm , schedule , distributed computing , mathematics , computer network , statistics , mathematical analysis , evolutionary biology , biology , operating system

We study resource constrained project scheduling problem with respect to resource leveling as objective function and allowance of preemption in activities. The branch and bound algorithms proposed in previous researches on resource leveling problem do not consider preemption. So, representing a model for the problem, a branch and bound algorithm is proposed. This algorithm can handle preemption in resource leveling problem. Comparing the resource leveling problem and the preemptive resource leveling problem, it is observed that considering preemption in the problem leads to better results in the objective function. This improvement imposes additional time to solve the problem. Coding the algorithm in MATLAB and checking it on the projects with 8 and 10 activities, results show that the proposed algorithm is efficient

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research