Case-based reasoning and improved adaptive search for project scheduling

DOI<201::AID-NAV2>3.0.CO;2-L 10.1002/(SICI)1520-6750(200004)47:3<201::AID-NAV2>3.0.CO;2-LzbMath0956.90011OpenAlexW1988005624MaRDI QIDQ4487088

Andreas Schirmer

Publication date: 21 June 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(200004)47:3<201::aid-nav2>3.0.co;2-l

zbMATH Keywords

heuristicsproject schedulingrandom samplingcase-based reasoning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (11)

An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem ⋮ Solving resource-constrained project scheduling problems: conceptual validation of FLP formulation and efficient permutation-based ABC computation ⋮ Experimental investigation of heuristics for resource-constrained project scheduling: an update ⋮ An analysis of network and resource indicators for resource-constrained project scheduling problem instances ⋮ Considering project management activities for engineering design groups ⋮ An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem ⋮ A scatter search algorithm for project scheduling under partially renewable resources ⋮ A neurogenetic approach for the resource-constrained project scheduling problem ⋮ A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem ⋮ An efficient multi-pass heuristic for project scheduling with constrained resources ⋮ Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem

Cites Work

• Unnamed Item
• Some efficient multi-heuristic procedures for resource-constrained project scheduling
• Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• On the use of the complexity index as a measure of complexity in activity networks
• PSPLIB -- a project scheduling problem library
• Artificial intelligence and human decision making
• Driving tabu search with case-based reasoning
• Problem space search algorithms for resource-constrained project scheduling
• Semi-greedy heuristics: An empirical study
• Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
• Project Scheduling Under Partially Renewable Resource Constraints
• Scheduling of Project Networks by Job Assignment
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
• Search Heuristics for Resource Constrained Project Scheduling
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• Adaptive search for solving hard project scheduling problems
• Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems

This page was built for publication: Case-based reasoning and improved adaptive search for project scheduling