On project scheduling problem

Authors:
A. A. Lazarev;E. R. Gafarov
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia;Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2008

Citing 4
Cited 0

An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Complex Scheduling (GOR-Publications)

Complex Scheduling (GOR-Publications)
Ant colony optimization for resource-constrained project scheduling

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consideration was given to the resource-constrained project scheduling problem and its special cases. The existing lower estimates of the objective function--minimization of the project time--were compared. It was hypothesized that the optimal value of the objective function of the nonpreemptive resource-constrained project scheduling problem is at most twice as great as that of the objective function with preemption. The hypothesis was proved for the cases of parallel machines and no precedence relation.