Time for interdisciplinarity:An essay on the added value of collaboration for science, university, and society

In this essay the following questions are raised 1. What exactly is interdisciplinarity and how does it distinguish itself from other forms of collaboration that transcend disciplines? 2. How, in short, has the practice of science proceeded with regard to the organization in disciplines; is interdisciplinary scientific practice increasing; and where do we stand now? 3. Is there a case for further strengthening and stimulating interdisciplinarity in research and education at the university? Why or why not? 4. If so, how can interdisciplinarity best be organized in academia, specifically in Tilburg

Periodic multiprocessor scheduling

A number of scheduling and assignment problems are presented involving the execution of periodic operations in a multiprocessor environment. We consider the computational complexity of these problems and propose approximation algorithms for operations with identical periods as well as for operations with arbitrary integer periods

Periodic multiprocessor scheduling

A number of scheduling and assignment problems are presented involving the execution of periodic operations in a multiprocessor environment. We consider the computational complexity of these problems and propose approximation algorithms for operations with identical periods as well as for operations with arbitrary integer periods

Periodic assignment and graph colouring

We analyse the problem of executing periodic operations on a minimum number of identical processors under different constraints. The analysis is based on a reformulation of the problem in terms of graph colouring. It is shown that different constraints result in colouring problems that are defined on different classes of graphs, viz. interval graphs, circular-arc graphs and periodic-interval graphs. We discuss the colouring of such graphs in detail