Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Constraint-based planning and simulation of multiresource problems

: Geske, U.; Goltz, H.-J.; John, U.; Matzke, D.; Wolf, A.

Volltext urn:nbn:de:0011-b-733055 (1.2 MByte PDF)
MD5 Fingerprint: 2f6f19e63037696aa05fc76f1b6314f5
Erstellt am: 02.03.2006

Element named row_ProjectData has starweb_type Output Field Repeater but ID not found in STAR Web Designer.
Sankt Augustin: GMD Forschungszentrum Informationstechnik, 1998, 48 S.
GMD Report, 27
Buch, Elektronische Publikation
Fraunhofer FIRST ()
logic programming; optimization; planning; scheduling; configuration

Constraint-logic methods are suitable for solving complex combinatorial planning and configuration problems which include a large number of constraints. The methods allow to compute near-optimal plans within short computation times. Moreover, the methods are successful in solving multi-resource problems and can be applied to find plans which save resources like energy or material or find solutions for hard problems at all. Enterprises can take advantage of this capability to promote their competitiveness and to react faster on costumer demands, while acting environment-conscious. The techniques are exemplified by a timetabling problem for universities, a job-shop scheduling problem with a restricted electric peak load, a configuration problem of a technical device with low energy consumption, and a material requirements planning problem.

Inhalt S.5-6
1 Introduction S.7-8
2 Timetabling for Medical Faculties S.9-22
- 2.1 System CharPlan S.9-12
- 2.2 Timetables S.13-17
- 2.3 Assignment of rooms S.17-19
- 2.4.2 Interactive Planning S.18-19
- 2.5 Presentation in the Internet S.20
- 2.6 Kind of Constraints in CharPlan S.21
3 Multiresource Planning with Reduction of Peak Load S.23-26
4 Con guration of Energy Saving Devices S.27-30
5 Recon guration S.31-38
- Material Requirements Planning The Can-Build Problem S.34-38
- 5.1 Phase I: The Generalized Production Plan S.34-36
- 5.2 Phase II: Analysis S.36-38
- 5.3 Solving The Can-Build Problem Using CLP(R) S.38
- 5.4 E ciency Improved by Early Projection S.38
6 Packing problems S.39-40
7 Constraint-Logic Programming S.41-48