Complexity of mixed shop scheduling problems: A survey

We survey recent results on the computational complexity of mixed shop scheduling problems. In a mixed shop, some jobs have fixed machine orders (as in the job shop), while the operations of the other jobs may be processed in arbitrary order (as in the open shop). The main attention is devoted to establishing the boundary between polynomially solvable and NP-hard problems. When the number of operations per job is unlimited, we focus on problems with a fixed number of jobs.

The assassination of time (ζeta-philosophy)

The Digital Art Weeks PROGRAM (DAW06) is concerned with the application of digital technology in the arts. Consisting again this year of symposium, workshops and performances, the program offers insight into current research and innovations in art and technology as well as illustrating resulting synergies in a series of performances, making artists aware of impulses in technology and scientists aware of the possibilities of the application of technology in the arts.

Trembling the plane of immanence: media arts philosophy and the re-vision of art (or what’s acoustics got to do with the visual?)

Invited lecture at the Royal Academy of Art.