Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations

DOI10.1080/10556788.2015.1005838zbMath1336.90084OpenAlexW2079781434WikidataQ122450666 ScholiaQ122450666MaRDI QIDQ3458826

Francisco J. Santos-Arteaga, Kaveh Khalili-Damghani, Amir-Reza Abtahi, Madjid Tavana

Publication date: 28 December 2015

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2015.1005838

zbMATH Keywords

particle swarm optimizationgeneralized precedence relationsefficient epsilon-constraint methodpartial bound enumeration algorithmtime-cost-quality trade-off

Mathematics Subject Classification ID

Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

ANALYSIS OF BENEFITS OF INTEGRATING THE OPPOSITION BASED LEARNING TECHNIQUE INTO NON-DOMINATED SORTING GENETIC ALGORITHM III ⋮ Schedule-allocate and robust sequencing in three-machine robotic cell under breakdowns ⋮ An updated survey of variants and extensions of the resource-constrained project scheduling problem

Cites Work

• A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm
• Time and work generalised precedence relationships in project scheduling with pre-emption: an application to the management of service centres
• Project scheduling with finite or infinite number of activity processing modes -- a survey
• A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations
• On the discrete time, cost and quality trade-off problem
• A survey of variants and extensions of the resource-constrained project scheduling problem
• A parameter-tuned genetic algorithm for the resource investment problem with discounted cash flows and generalized precedence relations
• Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
• The discrete time-cost tradeoff problem revisited
• An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations
• Project management with time, cost, and quality considerations
• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Lower bounds for resource-constrained project scheduling problems.
• Resource-constrained project scheduling: A survey of recent developments.
• Project scheduling. A research handbook.
• Project scheduling under uncertainty: survey and research potentials
• Resource-constrained project scheduling: Notation, classification, models, and methods
• The multi-mode resource-constrained project scheduling problem with generalized precedence relations
• An integrated multi-objective framework for solving multi-period project selection problems
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search
• Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients
• Rangen: A random network generator for activity-on-the-node networks
• New computational results on the discrete time/cost trade-off problem in project networks
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Introduction to Evolutionary Algorithms

This page was built for publication: Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations