RO  EN
IMI/Publicaţii/CSJM/Ediţii/CSJM v.5, n.3 (15), 1997/

Grammar flow analysis reduction to scheduling problem

Authors: Ciubotaru Constantin

Abstract

The article describes a variant of GFA problem connected with shared storage. It shows that this GFA problem may be reduced to a well known problem of scheduling theory (the Bellmann-Johnson problem for two-machine conveyer system). It proposes an effective algorithm to solve a particular case of the problem.

K.Chebotar
Institute of Mathematics,
Academy of Sciences of Moldova,
5 Academiei str., Kishinev,
MD 2028, Moldova
phone: (373-2) 738073
e-mail:

Fulltext

Adobe PDF document0.15 Mb