000			01571naa a2200205uu 4500
001			8900
003			OSt
005			20190211154556.0
008			021203s2005 xx ||||gr |0|| 0 eng d
100	1		_aABEYASHINGHE, M. Chelaka L _931
245	1	0	_aAn efficient method for scheduling construction projects with resource constraints
260			_c2001
520	3		_aIn construction scheduling, conflicts can arise when activities require common resources that are availabel only in limited quantities. To overcome this, while retaining minimum project durations, mathematical techniques have been developed for allocating resources. However, these produce a "hard" inflexible approach to resource-constrained schedules. The authors propose an efficient resource allocation algorithm (LINRES) which offers a more flexible approach. To study its performance, an experiment was contucted on 10 small network examples (6 to 29 activities) and the results were compared with those generated by a total of 32 existing heuristic rules. The results shows that the LINRES algorithm outperformed most other heuristic rules, including the widely used MINSLK rule in both single - and multi-resource networks. It also provides a reasonable trade-off between the resource-aggregation profiles and the durations
700	1		_aGREENWOOD, David J _918124
700	1		_aJOHANSEN, D. Eric _918125
773	0	8	_tInternational Journal of Project Management _g19, 1, p. 29-45 _d, 2001 _w
942			_cS
998			_a20021203 _bCassio _cCassio
998			_a20060718 _b1152^b _cQuiteria
999			_aConvertido do Formato PHL _bPHL2MARC21 1.1 _c9045 _d9045
041			_aeng