In scheduling one is given a set of jobs which has to to be distributed on machines or processors. The problem types in this field are numerous. Jobs may be equipped with release times,deadlines and precedence constraints and may be scheduled with preemptive or non-preemptive policies. The objective can be e.g. to minimize the makespan, the number of needed machines, the (weighted) sum of completion times and so on and so forth.
In real-time scheduling the input consists of a set of tasks that release jobs periodically or sporadically.
We work on algorithmic aspects in this field as well as on complexity issues.
Apart from the obvious application in computer science, scheduling is also of high practical impact in operations research.
Please note that the publication lists from Infoscience integrated into the EPFL website, lab or people pages are frozen following the launch of the new version of platform.
The owners of these pages are invited to recreate their publication list from Infoscience.
For any assistance, please consult the Infoscience help or contact support.
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
2010.18th Annual European Symposium on Algorithms (ESA2010), Liverpool, United Kingdom, September 6-8, 2010. p. 11-22. DOI : 10.1007/978-3-642-15775-2_2.
2010.37th International Colloquium on Automata, Languages and Programming (ICALP2010), Bordeaux, France, July 5-10, 2010. p. 299-311. DOI : 10.1007/978-3-642-14165-2_26.
2008.Automata, Languages and Programming, 35th International Colloquium (ICALP 2008), Reykjavik, Iceland, July 7-11, 2008. p. 246-257. DOI : 10.1007/978-3-540-70575-8_21.
