Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement

Value of the parameters <svg height="14.925" id="M233" style="vertical-align:-5.76988pt" version="1.1" viewbox="0 0 15.8875 14.925" width="15.8875" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,7.675)"><path d="M383 397q0 -32 -35 -49q-12 -6 -23 8q-37 45 -84 45t-90 -71q-40 -65 -40 -167q0 -57 22 -86t59 -29q38 0 81.5 24.5t69.5 51.5l16 -21q-44 -53 -104 -84t-109 -31q-56 0 -89.5 41t-33.5 117q0 61 30 124t79 105q33 28 81 50.5t86 22.5q34 0 59 -15.5t25 -35.5z" id="x1D450"></path></g>
<g transform="matrix(.012,-0,0,-.012,6.962,11.762)"><path d="M394 607q0 -25 -15.5 -43t-39.5 -18q-19 0 -32 13t-13 35t16 41.5t40 19.5q20 0 32 -13.5t12 -34.5zM360 349l-57 -283q-38 -188 -122 -263q-72 -64 -114 -64q-16 0 -30 10.5t-14 22.5q0 24 21 45q15 13 26 6q30 -20 54 -20q41 0 65 95q37 147 86 415q6 34 6.5 42.5
t-5.5 11.5q-18 0 -79 -54l-14 25q48 48 96.5 79t71.5 31q29 0 9 -99z" id="x1D457"></path></g><g transform="matrix(.012,-0,0,-.012,11.996,11.762)"><path d="M238 681l-124 -585q-7 -31 4 -31q10 0 37.5 18.5t49.5 41.5l16 -22q-40 -48 -89.5 -81.5t-76.5 -33.5q-42 0 -16 122l105 488q7 32 0 41t-39 9h-35l5 26q35 3 71 13t58 17.5t26 7.5q14 0 8 -31z" id="x1D459"></path></g>
</svg> in test instances.

Mathematical Problems in Engineering

tab1

Table 1

Table 1: Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement 

Table 1 | Branch and Bound Algorithms for Resource Constrained Project Scheduling Problem Subject to Nonrenewable Resources with Prescheduled Procurement 