Everyone

De-cycling Scheduling Problems

michele.lombardi2@unibo.it — Fri, 22 Mar 2013 21:07:57 +0000

De-cycling Scheduling Problems michele.lombar… Fri, 22/03/2013 - 22:07

Everyone

Here you can access data and code related to the paper:

A. Bonfietti, M. Lombardi, M. Milano, "De-cyclic Cyclic Scheduling Problems", Proc. of ICAPS 2013

The code (downloadable here) is a single, fairly simple, cpp file for ILOG CP Optimizer. I am afraid the documentation is poor, but you can contact me via email to get more information.
The instances (get a zip file with the whole lot here) are syntetically generated and feature a single resource. The resource requirement are specified in each file, while the resource capacity is passaed as a parameter to the solver.

The Weighted Average Constraint

michele.lombardi2@unibo.it — Fri, 11 Jan 2013 11:28:50 +0000

The Weighted Average Constraint michele.lombar… Fri, 11/01/2013 - 12:28

Argumentation in the Semantic Web

federico.chesani@unibo.it — Tue, 28 Aug 2012 10:49:55 +0000

Argumentation in the Semantic Web federico.chesa… Tue, 28/08/2012 - 12:49

Robust Scheduling

michele.lombardi2@unibo.it — Tue, 10 Jul 2012 16:36:36 +0000

Robust Scheduling michele.lombar… Tue, 10/07/2012 - 18:36

Everyone

This page contains the code of a solver to build optimized robust schedules for problems where tasks have fixed or even uncertain duration. The approach couples an off-line optimizer and an simple on-line scheduling policy and was moslty developed in the context of the FP7 Project SMECY.

The off-line optimizer is based on the Precedence Constraint Posting technique, i.e. a "schedule" is in fact a set of precedence constraints that make the original graph conflict free. The solver searches for feasible schedules by branching over Minimal Critical Sets, which can be identified using a number of different techniques.

The on-line scheduling policy can be arbitrarily chosen, provided that some basic specifications are satisfied. In detail, we support two broad classes of on-line schedulers:

Non-delay schedulers: an policy in this classes never delays a task if all its predecessors have completed executions and enough resources are available. Many widely adopted methods fall into this category (e.g. First Come First Served, Fixed Priority Scheduling...). In case a non-delay scheduler is used, it is possible to instruct the off-line optimizer to take into account the policy behavior: this results in the addition of fewer precedence constraints and hence lower run-time overhead.
General on-line schedulers: a policy in this class may abritrarily decide to delay a task. This may be useful if the optimized application is not the only one running on the system, so that a task may be delayed to perform some computation belonging to a different application. In this case, the on-line scheduler must also guarantee the satisfactio of a set of restricted deadlines, provided by the off-line optimizer.

The code is known to compile on Ubuntu Linux distributions. Dependencies include the boost library and the IBM ILOG CP suite (version 1.5 or above), available for free for academic use via the IBM Academic Initiative. The code is released with a detailed README file, containing instruction about how to build and run the software. Moreover, we include a subset of Resource Constraint Scheduling Problem instances from the PSPlib library, in the input format required by the PCP scheduler.

Here are the links to al available resources:

Optimizer code + examples from the PSPlib (all with fixed durations)
Synthetic task graph instances, pre-mapped on two different platforms (NOTE: you need to change some compile time options to make this work, in particular the minimum/maximum property names: check the README about this)

If you need further information, you can contact me via email or refer to references [bib]467[/bib][bib]lombardi2011robust[/bib][bib]DBLP:conf/cp/LombardiM10[/bib][bib]DBLP:conf/cp/LombardiM09[/bib]

Teaching Activities

michele.lombardi2@unibo.it — Tue, 21 Feb 2012 23:17:53 +0000

Teaching Activities michele.lombar… Wed, 22/02/2012 - 00:17

Everyone

This Section is devoted to teching activities of the AI group in Bologna. Professors in the group are responsible for several AI and Computers Science related courses the the Engineering Faculty.

Since this section is quite new, we only provide a link to the web-site of the course Sistemi Intelligenti M (Intelligent Systems M), in Italian.

Conformance Checking of Executed Clinical Guidelines in Presence of Basic Medical Knowledge

federico.chesani@unibo.it — Sun, 19 Feb 2012 21:26:01 +0000

Conformance Checking of Executed Clinical Guidelines in Presence of Basic Medical Knowledge federico.chesa… Sun, 19/02/2012 - 22:26

On the Clinical Guidelines Topic

federico.chesani@unibo.it — Tue, 20 Sep 2011 13:11:10 +0000

On the Clinical Guidelines Topic federico.chesa… Tue, 20/09/2011 - 15:11

Everyone

Sui progetti europei:

Pagina relativa alel call ICT http://ec.europa.eu/research/participants/portal/page/cooperation#ict
Un possibile partner industriale: Noemalife http://www.noemalife.com/en/home/
Work Programme 2011-2012 (vedi attachment)
Call 8 su ICT (vedi attachment)

Possibili related per articoli:

ASBRU http://www.asgaard.tuwien.ac.at/asbruview/index.html
van der Aalst http://www.win.tue.nl/declare/wp-content/papercite-data/pdf/clinical_guidelines.pdf
Valutazione di vdAalst dei sistemi per linee guida secondo criteri workflow, presentato a BPM2006 http://www.win.tue.nl/declare/wp-content/papercite-data/pdf/clinical_guidelines.pdf
Paper di Homerson e Lucas sulla Verification of Medical Guidelines (vedi attachment)

Per comodità, l'articolo presentato a ProHealth 2011 (vedi attachment)

MPOpt-Cell: a high-performance data-flow programming environment for the CELL BE processor

michele.lombardi2@unibo.it — Tue, 30 Aug 2011 16:20:44 +0000

MPOpt-Cell: a high-performance data-flow programming environment for the CELL BE processor michele.lombar… Tue, 30/08/2011 - 18:20

Methods for Designing Reliable Probe Arrays

michele.lombardi2@unibo.it — Tue, 30 Aug 2011 16:19:52 +0000

Methods for Designing Reliable Probe Arrays michele.lombar… Tue, 30/08/2011 - 18:19

A constraint based approach to cyclic RCPSP

michela.milano@unibo.it — Tue, 21 Jun 2011 12:01:31 +0000

A constraint based approach to cyclic RCPSP michela.milano… Tue, 21/06/2011 - 14:01