scientific article; zbMATH DE number 2047436

zbMATH Open1042.90022MaRDI QIDQ4451582FDOQ4451582

Authors: A. A. Stolyar, Yury Kochetov 

Publication date: 29 February 2004

Title of this publication is not available (Why is that?)

Recommendations

• Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
• Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic
• A variable neighborhood tabu search algorithm for project robust scheduling problems
• A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling
• A variable neighbourhood search algorithm for the constrained task allocation problem
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• Resource constrained project scheduling: a hybrid neural approach

zbMATH Keywords

decodernumerical experimentmultidimensional knapsack problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Cited In (19)

• Experimental investigation of heuristics for resource-constrained project scheduling: an update
• A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem
• Genetic algorithm for the resource-constrained project scheduling problem
• An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem
• A random key based genetic algorithm for the resource constrained project scheduling problem
• A variable neighbourhood search algorithm for the constrained task allocation problem
• Theoretical and practical fundamentals for multi-objective optimisation in resource-constrained project scheduling problems
• A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling
• A variable neighborhood tabu search algorithm for project robust scheduling problems
• LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
• A hybrid genetic algorithm for the resource-constrained project scheduling problem
• A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem
• A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
• Project selection, scheduling and resource allocation with time dependent returns
• Some algorithms of solving minimax multiprocessor scheduling problem
• Evolutionary algorithms applied to project scheduling problems—a survey of the state-of-the-art
• Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
• A survey of hybrid metaheuristics for the resource-constrained project scheduling problem
• A hybrid metaheuristic for the resource-constrained project scheduling problem

Uses Software

• PSPLIB

This page was built for publication:

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