Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, October 18, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Berit Johannes

Earliest Start Time Scheduling in AND/OR-graphs - An Introduction

AND/OR-networks are an intriguing generalization of ordinary precedence constraints and occur in various scheduling contexts. AND/OR-networks consist of traditional AND-precedence constraints, where a job can only be started after all its predecessors are completed, and OR-precedence constraints, where a job is ready to be scheduled as soon as any one of its predecessors is completed. The earliest start time scheduling problem consists of finding the non-negative component-wise minimal schedule that satisfies all AND/OR- constraints. The corresponding feasibility problem is known to be in NP and co-NP, but its actual complexity status has remained unknown. We will discuss some special cases for which polynomial-time algorithms have been proposed and provide some insights into the difficulties of the general problem.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login