Abstract
In this chapter we will use a logic programming approach in order to attack the scheduling problems described. Preliminary studies can be found in [46].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Note, fixing an index in a three-dimensional array and leaving the other indices free produces a two-dimensional array.
Note, the LINDO-calculations have been performed on a PC-compatible computer with an 80386dx processor, 40MHz clockpulse under DOS operating system. The CHARME experiment has been performed on an IBM PS2/95 system with an XP486 processor, 33MHz clockpulse under SCO-Unix operating system. Due to the comparison of the machines presented in Chapter 7 the latter is approximately three times faster than the former. A computation time of zero seconds indicates that less than half a second is required for solving the problem.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sprecher, A. (1994). An Artificial Intelligence Approach. In: Resource-Constrained Project Scheduling. Lecture Notes in Economics and Mathematical Systems, vol 409. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-48397-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-48397-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57834-5
Online ISBN: 978-3-642-48397-4
eBook Packages: Springer Book Archive