A new extension of the RCPSP in a multi-site context: Mathematical model and metaheuristics

Laurent, Arnaud; Deroussi, Laurent; Grangeon, Nathalie; Norre, Sylvie

doi:10.1016/j.cie.2017.07.028

Cited by 31 publications

(27 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…U. and Kusiak [33]; Babiceanu et al [34], and Coban [35] deal with the RCPSP in a dynamic, real time way. To obtain particular schedules at some point, metaheuristics are the most used techniques for solving RCPSP, including Tabu search [36,37], Simulated Annealing [38,39], or Genetic Algorithm [40]. Swarm Intelligence metaheuristics [41] are also effective for solving related issues.…”

Section: Ms-rcpspmentioning

confidence: 99%

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

Dai

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

This paper proposes a general variable neighborhood search-based memetic algorithm (GVNS-MA) for solving the multiskill resource-constrained project scheduling problem under linear deterioration. Integrating a solution recombination operator and a local optimization procedure, the proposed GVNS-MA is assessed on two sets of instances and achieves highly competitive results. One set of benchmark instances is commonly used in the literature where the capability of the proposed algorithm to find high quality solutions is demonstrated, compared with the state-of-the-art algorithms in the literature. The other set revises the former through incorporating the linear deterioration effect. Two key components of the proposed algorithm are investigated to confirm their critical role to the success of the proposed method.

show abstract

Section: Ms-rcpspmentioning

confidence: 99%

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

Dai

2019

Mathematical Problems in Engineering

View full text Add to dashboard Cite

show abstract

“…Precedence, the term used to define an order of tasks, is therefore usually present in RCPSPs, in most cases as a finish-to-start precedence relation. 12,[14][15][16][17][18][19][20] Other precedence relations are start-to-finish, start-to-start, and finish-to-finish relations, which Tavana et al 9 also address. Fauske 4 considers both finish-to-start and start-to-start precedence.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In a standard RCPSP, tasks are assumed to be located at a single location or site, while in the PTTP we consider multiple locations. Of the papers reviewed in this chapter, only Laurent et al 20 and Fauske 4 extend the RCPSP to include multiple locations. In the paper by Laurent et al, 20 rather than tasks being fixed to given locations, a subset of resources is tied to certain locations.…”

Section: Literature Reviewmentioning

confidence: 99%

“…21 H'Mida and Lopez 22 argue that the coordination of transportation cannot be neglected, as it affects the optimal solution. Recent research on multi-site RCPSPs that does consider travel time includes papers by Laurent et al, 20 H'Mida and Lopez, 22 Adhau et al, 23 and Fauske. 4 A task can be divisible, meaning that multiple resources or extra capacity can be assigned to a task to reduce its duration.…”

Section: Literature Reviewmentioning

confidence: 99%

“…They also ensure that a task can only be completed if the task skill requirements are met, and that the model does not award value to unnecessary work. Constraints (20) state that a resource's contribution to a task cannot be more than its own capacity.…”

Section: Resource Capacity Constraintsmentioning

confidence: 99%

See 2 more Smart Citations

A decomposition solution approach to the troops-to-tasks assignment in military peacekeeping operations

Chaudry

Vermedal

Fagerholt

et al. 2019

Journal of Defense Modeling & Simulation

View full text Add to dashboard Cite

This paper considers the Peacekeeping Troops-to-Tasks Problem (PTTP). The PTTP deals with assigning battlegroup resources to a set of tasks associated with a given peacekeeping mission. The tasks may be spread across several locations, and have requirements regarding the time at which they can be handled, and the skills and skill levels needed to complete them. There is also a utility value related to each completed task that reflects its importance. The resources are bound by a hierarchy of command, limiting their movement in relation to one another. The aim is to decide which tasks to complete, when, and by whom. We present a mathematical compact model for the PTTP, which includes a number of complicating real-life factors. Due to the complexity of the compact model, it is difficult to solve large instances using a commercial solver. Therefore, we also propose a decomposition-based solution approach, with a decomposed model where possible travel routes for the resources are generated a priori. The computational study shows that the decomposed model has better performance than the compact model, and that it can be used as a good starting point for developing a useful decision support tool for military peacekeeping operations planning.

show abstract

Project Scheduling a Critical Review of Both Traditional and Metaheuristic Techniques

Piñero Pérez,

Pupo,

Mahdi

et al. 2024

Studies in Computational Intelligence

View full text Add to dashboard Cite

A new extension of the RCPSP in a multi-site context: Mathematical model and metaheuristics

Cited by 31 publications

References 18 publications

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

A Memetic Algorithm for Multiskill Resource‐Constrained Project Scheduling Problem under Linear Deterioration

A decomposition solution approach to the troops-to-tasks assignment in military peacekeeping operations

Project Scheduling a Critical Review of Both Traditional and Metaheuristic Techniques

Contact Info

Product

Resources

About