An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
From MaRDI portal
Publication:1698276
DOI10.1007/s10479-016-2336-8zbMath1380.90112OpenAlexW2529544702MaRDI QIDQ1698276
Ahad Ali, Mohd Khairol Anuar Ariffin, Aidin Delgoshaei, Timon Rabczuk
Publication date: 15 February 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2336-8
Related Items (2)
Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource ⋮ Project scheduling cost optimization based on resource transfer costs and robustness
Uses Software
Cites Work
- Unnamed Item
- Project scheduling with finite or infinite number of activity processing modes -- a survey
- The scheduling of activities to maximize the net present value of projects
- Bi-objective resource-constrained project scheduling with robustness and makespan criteria
- Linear programming based algorithms for preemptive and non-preemptive RCPSP
- Fuzzy project scheduling problem and its hybrid intelligent algorithm
- A survey of variants and extensions of the resource-constrained project scheduling problem
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
- An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows
- Project scheduling under time dependent costs -- a branch and bound algorithm
- Genetic algorithm-based multi-criteria project portfolio selection
- Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models
- Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- Pre-emption in resource-constrained project scheduling
- Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements
- Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case
- Cash Flows in Networks
- A robust genetic algorithm for resource allocation in project scheduling
- Project scheduling with multiple modes: A genetic algorithm
- Four payment models for the multi-mode resource constrained project scheduling problem with discounted cash flows
- Analysis of scheduling schemes and heuristic rules performance in resource-constrained multiproject scheduling
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
This page was built for publication: An applicable method for modifying over-allocated multi-mode resource constraint schedules in the presence of preemptive resources
