A 3/2 algorithm for two-machine open shop with route-dependent processing times

This paper considers the problem of minimizing the schedule length of a two-machine shop in which not only can a job be assigned any of the two possible routes, but also the processing times depend on the chosen route. This problem is known to be NP-hard. We describe a simple approximation algorithm that guarantees a worst-case performance ratio of 2. We also present some modifications to this algorithm that improve its performance and guarantee a worst-case performance ratio of 3=2.

[Book review] Complex Cases: Perspectives on the Netherlands Criminal Justice System

Review of: Complex Cases: Perspectives on the Netherlands Criminal Justice System. (Eds.) M. Malsch & J.F. Nijboer. Thela Thesis Publishers (2000)