On the online track assignment problem (joint work with G. Di
Stefano and B. Leroy-Beaulieu)
-----------------------------------
          
ABSTRACT
-----------------------------------
Consider a train station consisting of a set of parallel tracks. 
Each track can be approached from one side only or from 
both sides and the number of trains per track may be limited or not. 
The departure times of the trains are fixed according to a given time table. 
The problem is to assign a track to each train as soon as it 
arrives to the station and such that it can leave the depot on 
time without being blocked by any other train.
We show that this problem can be modeled with online coloring 
of graphs. Depending on the constraints, the graphs can be 
overlap graphs (also known as circle graphs) or permutation 
graphs, and the coloring can be bounded or classical. 
This work covers several combinations of these cases.
          
SPEAKER(S)
-----------------------------------
dr. Marc DEMANGE
ESSEC Business School
Paris
Franta
-----------------------------------
Dr. Marc Demange is Professor at Information Systems 
and Decision Sciences Department and 
ESSEC Research Center Director. 
His research areas are Operations research, Combinatorial
optimization, Modeling, Approximation of hard problems,
On-line algorithms, Combinatorial inverse optimization.

URL http://www45.essec.edu/faculty/marc-demange
-----------------------------------