A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations

DOI10.1016/J.COR.2014.04.003MaRDI QIDQ337079zbMATH OpenOpenAlexFDO

Authors Elham Nabipoor Afruzi, Amir Abbas Najafi, Emad Roghanian, Mostafa Mazinani

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.04.003

zbMATH Keywords

project schedulingdiscrete time-cost-quality trade-offmode identitymoicaresource-constrained

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the discrete time, cost and quality trade-off problem
• Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
• scientific article; zbMATH DE number 5631147
• Project scheduling: time-cost tradeoff problems
• A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Cites work

• scientific article; zbMATH DE number 837310 (Why is no real title available?)
• A Dynamic Programming Algorithm for Decision CPM Networks
• A genetic algorithm approach for the time-cost trade-off in PERT networks
• Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks
• Hardness of approximation of the discrete time-cost tradeoff problem
• Multi-objective optimization of time-cost-quality using multi-colony ant algorithm
• New computational results on the discrete time/cost trade-off problem in project networks
• On the discrete time, cost and quality trade-off problem
• PSPLIB -- a project scheduling problem library
• Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application
• The discrete time/cost trade-off problem: Extensions and heuristic procedures
• The resource constrained project scheduling problem with multiple crashable modes: A heuristic procedure
• The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

Cited in

(7)

• Preprocessing the discrete time-cost tradeoff problem with generalized precedence relations
• Solving multi-mode time–cost–quality trade-off problems under generalized precedence relations
• Multi-mode resource constrained project scheduling problem along with contractor selection
• On the discrete time, cost and quality trade-off problem
• Optimizing temporary work and overtime in the time cost quality trade-off problem
• Multi-objective optimization of time-cost-quality using multi-colony ant algorithm
• An updated survey of variants and extensions of the resource-constrained project scheduling problem

Describes a project that uses

Uses Software

• SPEA2
• PSPLIB

This page was built for publication: A multi-objective imperialist competitive algorithm for solving discrete time, cost and quality trade-off problems with mode-identity and resource-constrained situations

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