Modification of Minimum Moment Approach in Resource Leveling

Hiyassat, Mohammed

doi:10.1061/(asce)0733-9364(2000)126:4(278)

Cited by 44 publications

(25 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The method levels the resources by using the float free time for the non-critical activities, and assume limit project duration and unlimited resources. Later Hiyassat (2000) develops Harris' method by considering the value of activity's free float time and its resource rate for how to select the activity that will be shifted to the new position. Hiyassat (2001) extends the modification of the previous method (Hiyassat 2000) and applies to network with multi resources under the same conditions.…”

Section: Literature Reviewmentioning

confidence: 99%

Integrated multi-resource planning and scheduling in engineering project

Issa¹,

Tu²

2017

10.5267/j.jpm

View full text Add to dashboard Cite

Planning and scheduling processes in project management are carried out sequentially in practice, i.e. planning project activities first without visibility of resource limitation, and then scheduling the project according to these pre-planned activities. This is a need to integrate these two processes. In this paper, we use Branch and Bound approach for generating all the feasible and non-feasible project schedules with/without activity splitting, and with a new criterion called "the Minimum Moments of Resources Required around X-Y axes (MMORR)", we select the best feasible project schedule to integrate plan processing and schedule processing for engineering projects. The results illustrate that this integrated approach can effectively select the best feasible project schedule among alternatives, improves the resource utilization, and shortens the project lead time.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Integrated multi-resource planning and scheduling in engineering project

Issa¹,

Tu²

2017

10.5267/j.jpm

View full text Add to dashboard Cite

show abstract

“…Additional works will be necessary in the following cases: (1) if activity 5 is done before activity 2, the additional work [2,5] with duration of 2 days, requiring 2 units of resource 1 per day, is needed to prevent staining with plaster mortar; (2) when activity 9 is performed before activity 7, floor covering (i.e. the additional work [7.9]) is needed, which has a duration of 1 day and requires 1 unit of resource 1 per day; and (3) if activity 10 is implemented before activity 8, some local repainting (i.e.…”

Section: Case Studymentioning

confidence: 99%

“…In literature, many methods have been developed to deal with the resource leveling problem using techniques such as mathematical programming models [2], heuristic procedures [3][4][5], and intelligent algorithms [6][7][8][9][10]. All these methods assume fixed precedence relations, hence requiring the work sequences to remain unchanged.…”

Section: Introductionmentioning

confidence: 99%

Resource Leveling with Soft Precedence Relations

Zhang¹,

Zou²

2017

dtcse

View full text Add to dashboard Cite

Abstract. This paper presents a mixed-integer linear model for solving the resource leveling problem with soft precedence relations. The model allows reversing of a work sequence of activities and aims to minimize the sum of the costs resulting from the fluctuations in resource usage from period to period without exceeding the specified deadline. The effectiveness of the proposed model is verified using an illustrative project, with the results showing that using soft precedence relations between activities provides more potential for reducing the fluctuations of resource utilization.

show abstract

“…Hiyassat [36] devised a heuristic to reduce the calculations needed for the minimum moment approach. Jeetendra et al [37] proposed the use of Petri Nets (PNs) and a P-matrix to help in token movements, describing an algorithm for the RLP.…”

Section: Heuristics Algorithmsmentioning

confidence: 99%

“…The precedence constraints are given in Eq. (37). The prescribed makespan, as the maximum project duration, is preserved by Eq.…”

Section: An Adaptive Genetic Algorithm (Aga) For the Rlp With Multiplmentioning

confidence: 99%

The Resource Leveling Problem with multiple resources using an adaptive genetic algorithm

Ponz-Tienda

Piqueras

Pellicer

et al. 2013

Automation in Construction

View full text Add to dashboard Cite

THE RESOURCE LEVELING PROBLEM WITH MULTIPLE RESOURCES USING AN ADAPTIVE GENETIC ALGORITHMPonz-Tienda, J.L.Yepes, V.Pellicer, E.Moreno-Flores, J. Title Page THE RESOURCE LEVELING PROBLEM WITH MULTIPLE RESOURCES USING AN ADAPTIVE GENETIC ALGORITHM AbstractResources management ensures that a project is completed on time and at cost, and that its quality is as previously defined; nevertheless, resources are scarce and their use in the activities of the project leads to conflicts in the schedule. Resource leveling problems consider how to make the resource consumption as efficient as possible. This paper presents a new Adaptive Genetic Algorithm for the Resource Leveling Problem with multiple resources, and its novelty lies in using the Weibull distribution to establish an estimation of the global optimum as a termination condition. The extension of the project deadline with a penalty is allowed, avoiding the increase in the project criticality punishing the shift of activities. The algorithm is tested with the standard Project Scheduling Problem Library PSPLIB, and a complete analysis and benchmarking test instances are presented. The proposed algorithm is implemented using VBA for Excel 2010 in order to provide a flexible and powerful decision support system that enables practitioners to choose between different feasible solutions to a problem, and in addition it is easily adjustable to the constraints and particular needs of each project in realistic environments.

show abstract

Modification of Minimum Moment Approach in Resource Leveling

Cited by 44 publications

References 2 publications

Integrated multi-resource planning and scheduling in engineering project

Integrated multi-resource planning and scheduling in engineering project

Resource Leveling with Soft Precedence Relations

The Resource Leveling Problem with multiple resources using an adaptive genetic algorithm

Contact Info

Product

Resources

About