A new heuristic for project scheduling with a single resource constraint

Khattab, M.; Choobineh, F.

doi:10.1016/0360-8352(90)90171-h

Cited by 10 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is well known that obtaining an optimal schedule for the resource-constrained multiproject scheduling problem is NP (non-polynomial) hard (Khattab and Choobineh (1991b). This means that the problem cannot be solved in a computationally ef® cient manner using any of the existing optimization procedures.…”

Section: Discussionmentioning

confidence: 98%

Two heuristics for scheduling multiple projects with resource constraints

Tsai¹,

Chiu²

1996

Construction Management and Economics

View full text Add to dashboard Cite

The purpose of this paper is to develop two ef® cient heuristic priority rules for the resource-constrained multiproject scheduling problem. The aptness of the two heuristic rules is analysed in terms of several dynamic characteristics of the scheduling problem. Fifteen heuristic rules presented in previous studies are used for comparison with the two heuristic rules on 4941 test problems which were generated by combining two, three or four projects from seven typical networks. The results indicate that the two proposed heuristics are superior to the other scheduling rules under the performance criteria of the minimum total project delay and the maximum number of times that a scheduling rule can obtain the best solution. Encouragingly, the two heuristic rules are proven to be adaptive and stable enough for scheduling under different problem sizes, network structures and degrees of resource tightness. As a result, the two proposed rules are the best representatives of the single priority rule method and the weighted combination search method, respectively. This study also includes a categorization process on which a project summary measure is based and then provides project schedulers with a convenient scheme to adopt appropriate scheduling rules.

show abstract

Section: Discussionmentioning

confidence: 98%

Two heuristics for scheduling multiple projects with resource constraints

Tsai¹,

Chiu²

1996

Construction Management and Economics

View full text Add to dashboard Cite

show abstract

“…Tsubakitani and Deckro [57] developed a heuristic method for multi-project scheduling with resource constraints. Khattab M, Choobineh [58] introduced a new heuristic for project scheduling with single resource constraint. Shankar and Nagi [59] used simulated annealing method for multi-project planning problem.…”

Section: Drum Buffer Rope Methodsmentioning

confidence: 99%

Coordinated Planning and Scheduling of Multiple Projects With New Projects Arrival Under Resource Constraint Using Drum Buffer Rope Heuristic

Yue

Ullah²,

Awadh

2022

IEEE Access

View full text Add to dashboard Cite

Planning and scheduling of multiple projects is significant for efficient utilization of constraint resources. However, in most of the project based companies, planning and scheduling of projects is performed in hierarchical manner with less focus given on coordination between the planning and scheduling levels, which leads to make inefficient plans and cause delays in projects and underutilize the resources. Therefore, current research is focused on coordinated planning and scheduling of multiple projects under resource constraints. Further, arrival of new projects in the planning horizons is also considered during planning and scheduling of multiple projects in planning horizons. Current research proposed drum buffer rope heuristic (DBRH) for coordinated planning and scheduling of multi projects with new projects arrival in rolling horizon. The proposed DBRH integrates higher level planning (HLP) with medium level planning (MLP), identify the critical activities of multiple projects, determine the capacity constraint sharing resources (CCSR) and make efficient plan and schedule of multiple projects with an aim to minimize the total tardiness of multiple projects. Moreover, in each planning horizon, the multiple project activities are updated using push and pull strategies in DBRH to maximize the utilization of CCSR. The performance of the DBRH is measured with the performance of standard genetic algorithm (GA), simulated annealing (SA), GA with priority of maximum tardiness project (GA-MTP) and SA with priority of maximum tardiness project (SA-MTP) based on simple project data, standard benchmark project data and Case Company data. Experimental results indicate that the proposed DBRH gives better results as compared to the other heuristics including GA, SA, GA-MTP and SA-MTP.

show abstract

A Design-based Model for the Reduction of Software Cycle Time

Collier

Collofello

1996

Softw. Process: Improve. Pract.

View full text Add to dashboard Cite

A new heuristic for project scheduling with a single resource constraint

Cited by 10 publications

References 4 publications

Two heuristics for scheduling multiple projects with resource constraints

Two heuristics for scheduling multiple projects with resource constraints

Coordinated Planning and Scheduling of Multiple Projects With New Projects Arrival Under Resource Constraint Using Drum Buffer Rope Heuristic

A Design-based Model for the Reduction of Software Cycle Time

Contact Info

Product

Resources

About