A Note on using Graphs in Regular Scheduling Problems
A Note on using Graphs in Regular Scheduling Problems
Author(s): Peter CzimmermannSubject(s): Methodology and research technology, Transport / Logistics
Published by: Žilinská univerzita v Žilině
Keywords: Scheduling; Problems; Graphs;
Summary/Abstract: 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.
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 5/2003
- Issue No: 4
- Page Range: 47-48
- Page Count: 2
- Language: English
