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.

Expectations and promises

Discusses the Chancery Division judgment in Thorner v Curtis on a claim by an unpaid farm worker, who was led to expect that he would inherit the farm. Examines whether proprietary estoppel could be proved even if the deceased landowner made no express promise. Reviews case law on proprietary estoppel.

A clear direction

Comments on the House of Lords decision in Thorner v Curtis, also referred to as Thorner v Major, on whether an unpaid farm labourer could rely on assurances made by the farmer that he would inherit the farm, to establish proprietary estoppel when the farmer died intestate. Considers whether the assurances had been clear and whether the property to be inherited could be specifically identified. Notes the Lords' consideration of the possible existence of a constructive trust. [From Legal Journals Index]