Shop-scheduling problems with fixed and non-fixed machine orders of the jobs

The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, 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). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.

The phenomenology of religious life: Nietzsche and Bergson

In this paper I identify and discuss some themes in the thought of Nietzsche and Bergson respectively as these bear upon the wider project to which the paper contributes – the articulation of a philosophical naturalism which offers a non-reductive account of the origin and nature of religion on the basis that the real is 'religious' in essence. Implicitly, an alternative is thereby proposed to the approaches and presuppositions of the 'theological turn' perspective within contemporary 'continental philosophy of religion'. [PROVIDED BY THE AUTHOR]