Browsing by Author "Anthonissen, Carel Aaron"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Die geloofwaardigheid van die kerk in die teologie van Dietrich Bonhoeffer
    (Stellenbosch : Stellenbosch University, 1993-12) Anthonissen, Carel Aaron; Jonker, W. D.; Stellenbosch University. Faculty of Theology. Dept. of Practical Theology and Missiology.
    ENGLISH ABSTRACT: In South Africa the church has always been involved in the problems of society - either in legitimating a particular political order or in critical protest aimed at bringing about change. In the future such social involvement will necessarily be continued. All along the crucial question has been whether the church remains true to its calling. Can the church command credibility on the basis of being truly authentic? In Nazi-Germany this was a question which deeply troubled the theologian, Dietrich Bonhoeffer. His thinking on this matter is of particular relevance to the church in South Africa today.
  • Thumbnail Image
    Item
    A population-based approach to sequential ordering problems
    (Stellenbosch : University of Stellenbosch, 2007-03) Anthonissen, Carel Aaron; Bekker, James F.; University of Stellenbosch. Faculty of Engineering. Dept. of Industrial Engineering.
    This project was initiated to develop a new and novel approach to address complex sequencing problems, in particular, an alternative method was developed to find solutions to the sequential ordering problem. The sequential ordering problem is concerned with the arrangement of a number of elements in a sequence that respects a number of precedence constraints and results in the lowest overall cost. A precedence constraint requires that some element will occur before another in the solution sequence, and the cost of a solution is determined by summing the independent individual costs that are incurred when progressing from one specific element in the solution sequence to another. Instances of this problem are regularly found in the practice of industrial engineering in problems such as the routing of a delivery vehicle, the scheduling of jobs on a machine and the preparation of project plans with limited resources. The sequential ordering problem is known to be complex in the sense that as the size of problem instances increases, the best-known time required to find a guaranteed optimal solution increases exponentially.