PT Journal
AU Czimmermann, P
TI A Note on using Graphs in Regular Scheduling Problems
SO Communications - Scientific Letters of the University of Zilina
PY 2003
BP 47
EP 48
VL 5
IS 4
DI 10.26552/com.C.2003.4.47-48
WP https://komunikacie.uniza.sk/artkey/csl-200304-0009.php
DE no keywords
SN 13354205
AB This paper deals with regular permutation scheduling on graphs. Pesko 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.
ER