Two-machine open shop scheduling with an availability constraint

We study a two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval. The objective is to minimize the makespan. We show that the problem is NP-hard and present an approximation algorithm with a worst-case ratio of 4/3.

Staff training in the mental health needs of people with learning disabilities in the UK

This paper gives a general overview of some of the factors involved in the training and knowledge of learning disabilities staff relating to mental health. Early indications from research have shown that training may be effective as a way of addressing these problems, but further research and clear guidance on best practice in implementing staff training are needed in this important area.