TITLE: Temporal Networks with Alternatives

PRESENTER: Roman Bart, http://kti.mff.cuni.cz/~bartak/, bartak@ktiml.mff.cuni.cz

AFFILIATION:Department of Theoretical Computer Science and Mathematical Logic, Charles University, http://kti.mff.cuni.cz/

DATE: Tuesday 23th September 2008

TIME: 11:00:00

PLACE: CSE Seminar Room, Level 1, K17

ABSTRACT:

Modelling manufacturing (and other) processes frequently involves temporal
and logical part. The temporal part models precedence relations between
the operations of the process while the logical part describes existential
relations between the operations such as exclusion or dependency. In this
talk we focus on specific logical relations describing splitting and
joining of processes. We formally introduce Temporal Networks with
Alternatives (TNA) and present some complexity results for problems
involving TNAs. Then we describe a restricted form of TNA with a so called
nested structure and present a constraint model achieving global
consistency. Finally, some filtering techniques and complexity results for
temporal reasoning in TNAs are shown. These techniques are a fundamental
part of a new generic scheduling engine being developed in co-operation
with ManOpt Ltd.

BIOGRAPHY OF SPEAKER:

Dr. Roman Bartak is a head of Department of Theoretical Computer Science
and Mathematical Logic at Charles University in Prague, Czech Republic
where he works as an associate professor and a researcher. Previously,
he led research activities of a multinational company Visopt BV, where
he was the main architect of the scheduling engine developed by this
company. His current research work focuses on techniques of constraint
satisfaction and their application to planning and scheduling. He
published more than fifty research papers and presented several tutorials
about Constraint Programming and Planning and Scheduling at international
conferences, summer schools, and European universities.

Host:

Toby Walsh

Seminar Convenor:

Van Hai Ho