Optimierungsverfahren für die Personaleinsatz- und Ablaufplanung in chemischen Produktionsprozessen

TU-Logo


Startseite | zurück

Referenzen

[1] M. Bartusch, R. H. Möhring and F. J. Radermacher, Scheduling Project Networks with Resource Constraints and Time Windows, Annals of Operations Research, vol.16, 1988, pp. 201-240.

[2] R. Müller and A. S. Schulz, The interval order polytope of a digraph, in: (E. Balas and J. Clausen, eds.) 4th Int.IPCO Conference, Lecture Notes in Computer Science, vol. 920, Springer, 1995, pp. 50-64.

[3] J. Kallrath and J. M. Wilson, Business Optimisation Using Mathematical Programming, Macmillan Business, 1997.

[4] Andreas Fest, Rolf H. Möhring, Frederik Stork, and Marc Uetz, Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates, Technical Report 596/1998, Department of Mathematics, Technische Universität Berlin, submitted.

[5] Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, and Marc Uetz Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems, in Jaroslav Nesetril (ed.): Algorithms - ESA '99, Lecture Notes in Computer Science 1643, Springer, Berlin, 1999, pp. 139-150, Proceedings of the 7th Annual European Symposium on Algorithms (ESA'99)



Projektgalerie der Gruppe Kombinatorische Optimierung und Graphenalgorithmen

English project description "Algorithms for Scheduling Scarce Resources in Chemical Engineering"

TU Berlin | Math Department | Combinatorial Optimization and Graph Algoritms | FTP
Last modified: Tue Feb 23 20:28:58 MET 1999
Marc Uetz <uetz@math.tu-berlin.de>