6533b853fe1ef96bd12acaa7
RESEARCH PRODUCT
A heuristic algorithm for project scheduling with splitting allowed
Rafael MartíVicente VallsM. Pilar Lino Sorlísubject
Absolute deviationMathematical optimizationControl and OptimizationPrecedence diagram methodArtificial IntelligenceComputer Networks and CommunicationsComputer scienceComputationRangingManagement Science and Operations ResearchAlgorithmSoftwareInformation Systemsdescription
In this article, we analyze the precedence diagramming method, the only published algorithm for time-only project scheduling with activity splitting allowed. The criteria used in this method (forward and backward pass computations) for deciding when an activity has to be interrupted are shown to be invalid in some situations. We look into the causes of these failures and propose new formulae that always provide feasible solutions. The new algorithm has been tested on 240 randomly generated problems ranging up to 600 activities and 7,200 precedence relationships, resulting in an average deviation from optima of less than 1 percent.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1996-01-01 | Journal of Heuristics |