Article

Article title A BRANCH-AND-BOUND PROCEDURE FOR SOLVING RESOURCE-CONSTRAINED PROJECT SHEDULING PROBLEM
Authors M.V. Knyazeva
Section SECTION II. AUTOMATION OF DESIGNING
Month, Year 07, 2010 @en
Index UDC 519.87
DOI
Abstract A complex combinatorial problem of resource-constrained project planning was considered by the means of branch-and-bound procedures. Two variants of decision a problem is suggested, either classical, or extension alternative is used for introducing nodes of the decision tree. A problem, consisting of 10 activities with one type of limited resource and durations of activities is viewed, and computational results are given.

Download PDF

Keywords Project scheduling problem; branch-and-bound algorithm; extension alternatives.
References 1. Blazewicz, J., J.K. Lenstra and A.H.G. Rinnooy Kan. Scheduling Subject to Resource Constraints: Classification and Complexity, Discrete Applied Mathematics, 5. – Р. 11-24.
2. Demeulemeester, E.L., Herroelen W.S., Project Sheduling, a Research Handbook. Department of Applied Economics Katholieke Universiteit, Leuven Belgium, Kluwer Academic Publishers, 2002. – 685 p.

Comments are closed.