RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2008 Issue 12, Pages 86–104 (Mi at766)

This article is cited in 2 papers

Discrete Systems

On project scheduling problem

A. A. Lazarev, E. R. Gafarov

Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia

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.

PACS: 07.05.Kf, 02.10.Ox

Presented by the member of Editorial Board: D. A. Novikov

Received: 04.10.2007


 English version:
Automation and Remote Control, 2008, 69:12, 2070–2087

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024