From: Roland Hautz (insal047h_at_inn-salzach.de)
Date: Tue Mar 18 2003 - 20:09:19 CET
Date: Tue, 18 Mar 2003 20:09:19 +0100 (CET) From: Roland Hautz <insal047h@inn-salzach.de> Message-ID: <Pine.LNX.4.44.0303181907140.3662-100000@isabella.iivs.de> Subject: [taskjuggler-devel] I'd like to contribute an optimizing scheduler
Hello,
For my implementation of an optimizing scheduling algorithm I'm looking
for a home base as part of an open source project. Since I'm using a
slightly patched taskjuggler as development environment, your project
would be my first choice.
The algorithm is the brach-and-bound sequencing algorithm described in
ftp://ftp.bwl.uni-kiel.de/pub/operations-research/pdf/wp385.pdf and
ftp://ftp.bwl.uni-kiel.de/pub/operations-research/pdf/wp386.pdf .
The current state is: Table 4 of wp385.pdf is running and can be called
from a patched taskjuggler to solve smaller test projects. The bounding
rules are not yet included, and no other optimizations are done. But I'm
determined to optimize this function to death.
Solving means at the moment minimizing the makespan. However the objective
can be generalized, e.g. to the maximization of the cashflow.
Exploitation of this algorithm would demand slight modifications of the
taskjuggler language. Also a mapping between calendar time and the
discrete time slots of the algorithm still needs to be written. Then it
could be used as alternative or complete replacement of Task::schedule().
If you are interested, I'd be glad to hear, how to procede.
-- Roland Hautz -- To unsubscribe, email: taskjuggler-devel-unsubscribe@suse.com For additional commands, email: taskjuggler-devel-help@suse.com
This archive was generated by hypermail 2.1.7 : Tue Mar 18 2003 - 20:44:28 CET