Communications - Scientific Letters of the University of Zilina 2003, 5(4):47-48 | DOI: 10.26552/com.C.2003.4.47-48

A Note on using Graphs in Regular Scheduling Problems

Peter Czimmermann1
1 University of Zilina, Faculty of Managements and Informatics, Slovakia

This paper deals with regular permutation scheduling on graphs. Peško and Czimmermann introduced this problem (in [3]) and it is generalisation of a matrix permutation problem. The goal is to minimise differences between row sums of a real matrix that represents a schedule, but external conditions don't allow moving matrix elements arbitrarily. The conditions can be represented by permutation obtained from a certain graph.

Keywords: no keywords

Published: December 31, 2003  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Czimmermann, P. (2003). A Note on using Graphs in Regular Scheduling Problems. Communications - Scientific Letters of the University of Zilina, 5(4), 47-48. doi: 10.26552/com.C.2003.4.47-48
Share...
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. ČERNÝ, J., KLUVÁNEK, P.: Principles of Mathematical Theory of Transport (in Slovak), VEDA, Bratislava, (1991)
    2. ČERNÝ, J., VAŠEK, K., PEŠKO, Š., PALÚCH, S., ENGELTHALLER, D.: Transport schedulings and their optimization (in Slovak), Research report III-8-9/03, Research Institute of Transport, Žilina, (1986)
    3. CZIMMERMANN P., PEŠKO, Š.: The Regular Permutation Scheduling on Graphs, Journal of Information, Control and Management Systems, vol. 1, (2003)
    4. EVEN, S., KARIV, O.: An O(n5/2) Algorithm for Maximum Matching in General Graphs, Proc. 16th Annual Symp. on Foundations of Computer Science, IEEE, New York, (1975) Go to original source...
    5. PEŠKO, Š., VAŠEK, K.: Optimization of Transport Scheduling (in Slovak), Research report III-8-6/09.3, Research Institute of Transport, Žilina, (1983)
    6. PLESNÍK, J.: Graph Algorithms (in Slovak), VEDA, Bratislava, (1983)
    7. TEGZE, M., VLACH, M.: The Matrix Permutation Problem, Tech. Univ. Graz Bericht 84-54, (1984).

    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