scientific article; zbMATH DE number 2016119

MaRDI QIDQ4438846zbMATH OpenFDO

Authors Joaquín Bautista, Jordi Pereira

Publication date 10 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2504/25040257.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A modified ant colony algorithm for solving resource-constrained project scheduling problem
• Some aspects regarding the application of the ant colony meta-heuristic to scheduling problems
• A multi-colony ant algorithm for multi-objective resource-constrained project scheduling
• Problem space search algorithms for resource-constrained project scheduling
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.

Cited in

(5)

• A multi-colony ant algorithm for multi-objective resource-constrained project scheduling
• Some aspects regarding the application of the ant colony meta-heuristic to scheduling problems
• Solving software project scheduling problems with ant colony optimization
• Advances in Intelligent Data Analysis VI
• A modified ant colony algorithm for solving resource-constrained project scheduling problem

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 Q4438846)