Notes on Cycles in Activity-on-Arc Networks
Anna Černá and
Acta Oeconomica Pragensia, 2008, vol. 2008, issue 4, 29-36
A new type of cyclic activity graph is introduced. In contrast to the well-known "start-after-end" type with only one backward arrow, the new one admits several backward arrows representing the removal of working groups from the n-th to the (n + 1)-th cycle (e.g., from the previous family house being constructed to the next one). It is shown how to calculate minimum cycle length, first and last possible starting times of activities and slacks. Brief examples of applications (e.g., in building industry, manufacturing of airplanes, ships and cranes) are mentioned. Moreover, an example of traffic signal settings is presented in detail.
Keywords: Network; Activity; Cycle; Optimization; Application; Traffic Lights (search for similar items in EconPapers)
JEL-codes: C6 (search for similar items in EconPapers)
References: View complete reference list from CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
free of charge
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:prg:jnlaop:v:2008:y:2008:i:4:id:130:p:29-36
Ordering information: This journal article can be ordered from
Redakce Acta Oeconomica Pragensia, Vysoká škola ekonomická v Praze, nám. W. Churchilla 4, 130 67 Praha 3
Access Statistics for this article
Acta Oeconomica Pragensia is currently edited by Klára Šimůnková
More articles in Acta Oeconomica Pragensia from Prague University of Economics and Business Contact information at EDIRC.
Bibliographic data for series maintained by Stanislav Vojir ().