An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility

DOI10.1504/IJMOR.2010.035497zbMATH Open1198.90201OpenAlexW1993116207MaRDI QIDQ606604FDOQ606604

Authors: Najib M. Najid, Marouane Arroub 

Publication date: 17 November 2010

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2010.035497

Recommendations

• Formulation and tabu search algorithm for the resource constrained project scheduling problem.
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
• Resource-constrained project scheduling problem with multiple execution modes and fuzzy/crisp activity durations
• Resource-constrained project scheduling: A heuristic for the multi-mode case

zbMATH Keywords

tabu searchproject schedulinghuman resourcesflow graphsdecomposition-based heuristicslabour skillsmulti-mode schedulingmulti-skilled labourresource constrained schedulingresource limitation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Cited In (12)

• Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times
• An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem
• Um algoritmo exato para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos
• Project scheduling with flexible resources: formulation and inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem
• An integer programming approach to the multimode resource-constrained multiproject scheduling problem
• A polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and multiple modes
• Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
• The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

This page was built for publication: An efficient algorithm for the multi-mode resource constrained project scheduling problem with resource flexibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606604)