An evolutionary implicit enumeration procedure for solving the resource-constrained project scheduling problem

DOI10.1111/ITOR.12196MaRDI QIDQ4601638zbMATH OpenOpenAlexFDO

Authors Reza Zamani

Publication date 24 January 2018

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12196

zbMATH Keywords

combinatorial optimizationgenetic algorithmimplicit enumerationproject managementschedulingsearch-tree

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2086192
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
• scientific article; zbMATH DE number 1300399
• A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem
• Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm

Cited in

(4)

• Towards merging binary integer programming techniques with genetic algorithms
• A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
• Integrated time–cost tradeoff and resources leveling problems with allowed activity splitting
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic

This page was built for publication: An evolutionary implicit enumeration procedure for solving the resource-constrained project scheduling problem

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