Acta Oeconomica Pragensia 2008, 16(4):29-36 | DOI: 10.18267/j.aop.130

Notes on Cycles in Activity-on-Arc Networks

Anna Černá, Jan Černý
Ing. Anna Černá, CSc., - senior lecturer; Prague University of Economics, Faculty of Management. Prof. RNDr. Jan Černý, DrSc., Dr.h.c.; Prague University of Economics, Faculty of Management.

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
JEL classification: C6

Published: August 1, 2008  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Černá, A., & Černý, J. (2008). Notes on Cycles in Activity-on-Arc Networks. Acta Oeconomica Pragensia, 16(4), 29-36. doi: 10.18267/j.aop.130
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. BEKKE, J. H.; BAKKER, J. A. 2003. Fast Recursive Data Processing in Graphs Using Reduction. Proc. of the 21st IASTED International Conference Applied Informatics, 2003, February 10-13, Innsbruck, Austria.
    2. BIANCHINI, M.; GORI, M.; SARTI, L.; SCARSELLI, F. 2006. Recursive Neural Networks and Graphs: Dealing with Cycles. Lecture notes in Computer Science, Springer Berlin / Heidelberg, 2006, 38-43. Go to original source...
    3. HEIZER, J.; RENDER, B. 1999. Operations Management. 5*11 ed., Prentice Hall, Inc., Upper Saddle River NJ, 1999.
    4. KARAYIANNIS, A.; LOIZOU, G. 1978. Cycle Detection in Critical Path Networks. Information processing letters, 1978, Vol. 7, No. 1, 15-19. Go to original source...
    5. SANDNES, F. E.; SINNEN, O. 2005. A New Strategy for MultiproceSSor Scheduling of Cyclic TaSk GraphS. Int. J. High Performance Computing and Networking, 2005, Vol. Go to original source...
    6. SCHONBERGER, R. J.; KNOD, E. M. 1998. OperationS Management. 5*11 ed., Bisiness Publications, Inc., Plano Tex, 1998.
    7. STEVENSON, W. J. 1989. Introduction to Management Science. Boston MA : Irwin, 1989.
    8. WEINBLATT, H. 1972. A New Algorithm for Finding the Simple CycleS of a Finite Directed Graph. Journal of the ACM, 1972, Vol. 19, 45-56, No. 1., 62-71. Go to original source...

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content