Research on Project Scheduling Problem with Resource Constraints

Chen, Tinggui; Zhou, Guanglan

doi:10.4304/jsw.8.8.2058-2063

Cited by 4 publications

(4 citation statements)

References 29 publications

(27 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…T. Chen and G. Zhou [12], discussed the recent problems and researches in the domain of the resource constraint scheduling problem and proposed the solution which is based upon GA. The motive is to devise an algorithm that should provide optimal results.…”

Section: Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Novel Approach to Solve Resource Constrained Project Scheduling Problem (RCPSP)

Alhumrani¹,

Qureshi

2016

IJMECS

View full text Add to dashboard Cite

In this paper, resource constrained project scheduling problem is taken and solved using genetic algorithm. This algorithm solves the problem as a whole in software development, with the limited resource the project has to be scheduled to the team members. The main aim is to schedule and optimize the resource to complete the project within time. Due to resource constraint environment, the complexity of solving the algorithm increases exponentially. So the traditional methods are not suitable to solve the resource constraint problem. The Genetic Algorithm is taken to solve the multiple resource constraints project scheduling needs. This typical NP-hard problem is solved via mathematical model via genetic algorithm. Software development projects were considered to be resource constrained and project scheduling solution makes the algorithm time efficient.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

“…on Project Scheduling Problem with Resource Constraint [12] Work is more theoretical and argumentative.…”

Section: Researchmentioning

confidence: 99%

Novel Approach to Solve Resource Constrained Project Scheduling Problem (RCPSP)

Alhumrani¹,

Qureshi

2016

IJMECS

View full text Add to dashboard Cite

show abstract

“…The branch-and-bound algorithm developed by Brucker et al [4] generalizes branch-and-bound methods for the job shop scheduling problem and the multiprocessor task scheduling problem. Among other works, we distinguish the papers of Brucker et al [3], Sprecher [16], Baptiste and Demassey [1], Chen and Zhou [5].…”

Section: Introductionmentioning

confidence: 99%

On some implementations of solving the resource constrained project scheduling problems

Goncharov

Гимади

Mishin

2019

YUGOSLAV J OPERATION

View full text Add to dashboard Cite

We consider a resource-constrained project scheduling problem with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities preemptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose an exact branch and bound algorithm for solving the problem with renewable resources. It uses our new branching scheme based on the representation of a schedule in form of the activity list. We use two approaches of constructing the lower bound. We present results of numerical experiments, illustrating the quality of the proposed lower bounds. The test instances are taken from the library of test instances PSPLIB.

show abstract

“…But with advancement of computing speed and evolutionary algorithms such as Ant Colony (AC), Simulated Annealing (SA), Genetic Algorithm (GA), Particle Swarm Optimization (PSO), etc. which can deal with complexity effectively, researchers applied them to various scheduling problems [8]. In [9], an optimization method integrated ant colony algorithm with genetic algorithm was proposed, and it was applied into construction project scheduling, and the scheduling performance was improved.…”

Section: Introductionmentioning

confidence: 99%

A Cuckoo Search Algorithm for Scheduling Multiskilled Workforce

Nie

Liu

Xie

et al. 2014

JNW

View full text Add to dashboard Cite

Based on the situation of the construction and software industry, this paper presents a multi-skilled human resource scheduling model which considers the skill and the salary of the workforce at different levels. It introduces a novel cuckoo search (CS)-based approach to optimize the objective function which combines the minimization of the makespan and the project cost. The proposed approach takes the priority coding scheme to code for each job, and adopts the serial schedule generation scheme to sequentially allocate the start time and resources for one job with highest priority at a time. To match the discrete nature of the solution, the Lé vy flight operator of CS algorithm, which is originally suitable for continuous variable, has been modified. The CS-based approach has been implemented by using MATLAB R2010b and tested by a project taken from the literature, which contains 18 jobs and 6 multi-skilled workers. The results yielded by the CS-based approach have been found to significantly outperform genetic algorithm. This demonstrates that the cuckoo search algorithm based approach is suitable for scheduling the complicated resource constrained project with multi-skilled workforces.

show abstract

Research on Project Scheduling Problem with Resource Constraints

Cited by 4 publications

References 29 publications

Novel Approach to Solve Resource Constrained Project Scheduling Problem (RCPSP)

Novel Approach to Solve Resource Constrained Project Scheduling Problem (RCPSP)

On some implementations of solving the resource constrained project scheduling problems

A Cuckoo Search Algorithm for Scheduling Multiskilled Workforce

Contact Info

Product

Resources

About