Table of Contents
International Journal of Manufacturing Engineering
Volume 2013, Article ID 930920, 7 pages
Research Article

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

Faculty of Industrial and Mechanical Engineering, Islamic Azad University, Qazvin Branch, P.O. Box 34185-14161, Qazvin, Iran

Received 10 March 2013; Accepted 5 September 2013

Academic Editors: A. Che, G. Dessein, A. Lockamy, and G. Onwubolu

Copyright © 2013 Behrouz Afshar-Nadjafi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.