Abstract

This paper concerns resources scheduling using a simple heuristic model described as the “current float” model. Current sfloat is defined as the finish float available with respect to its latest finish time in the original network computations. The current float model allocates limited resources by giving priority to the activity that has the least current float. The current floats need be computed only for those activities that are engaged in a resource conflict. The “total float” models that were used previously required the tedious task of constructing and computing a status network every time an activity is postponed due to nonavailability of resources. The current float model avoids this and requires only the original network computations. The mathematical validity of the model is explained, and the paper presents proof that the output of this model is the same as that of the total float model. The physical significance of the model is also indicated. An application section is included to illustrate ...

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call