Minimizing total weighted completion time in a proportionate flow shop

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time. © 1998 John Wiley & Sons, Ltd.

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.

An algorithm for total variation inpainting based on nonlinear multi-grid methods

Image inpainting refers to restoring a damaged image with missing information. The total variation (TV) inpainting model is one such method that simultaneously fills in the regions with available information from their surroundings and eliminates noises. The method works well with small narrow inpainting domains. However there remains an urgent need to develop fast iterative solvers, as the underlying problem sizes are large. In addition one needs to tackle the imbalance of results between inpainting and denoising. When the inpainting regions are thick and large, the procedure of inpainting works quite slowly and usually requires a significant number of iterations and leads inevitably to oversmoothing in the outside of the inpainting domain. To overcome these difficulties, we propose a solution for TV inpainting method based on the nonlinear multi-grid algorithm.

Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval

In this note, we consider the scheduling problem of minimizing the sum of the weighted completion times on a single machine with one non-availability interval on the machine under the non-resumable scenario. Together with a recent 2-approximation algorithm designed by Kacem [I. Kacem, Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval, Computers & Industrial Engineering 54 (2008) 401–410], this paper is the first successful attempt to develop a constant ratio approximation algorithm for this problem. We present two approaches to designing such an algorithm. Our best algorithm guarantees a worst-case performance ratio of 2+ε. © 2008 Elsevier B.V. All rights reserved.

Jackson v JH Watson Property Investment Ltd.

Comments on the Chancery Division decision in Jackson v JH Watson Property Investment Ltd on whether a landlord was liable in nuisance to a long leaseholder in respect of damage caused to the demised property by a building defect which pre-dated the grant of the lease or whether the principle of caveat lessee applied. Considers whether the defect amounted to "disrepair" within the meaning of the landlord's repairing covenant.

A study on the cost sharing model for supply lead time reduction with component commonality

This paper studies a two-level supply chain consisting of components supplier and product assembly manufacturer, while the manufacturer shares the investment on shortening supply lead time. The objective of this research is to investigate the benefits of cost sharing strategy and adopting component commonality. The result of numerical analysis demonstrates that using component commonality can help reduce the total cost, especially when the manufacture shares a higher fraction of the cost of investment in shortening supply lead time.

Sewerage works: public investment in sewers saves lives

Without sewers, more children die, and those who survive suffer in terms of physical growth and educational attainment. Donor policies and advice on sewers are wrong in three key respects. Sewers in cities are not optional extras but essential. Sewers need to be financed by taxation not user charges. And sewers in cities are affordable for most countries, many of whom are already investing in sewers in their cities. The aid needed is concentrated in a few countries, and this is affordable for rich countries.

Challenges to Slovakia and Poland health policy decisions: use of investment treaties to claim compensation for reversal of privatisation/liberalisation policies

Investment treaties, and possibly the EU Treaty itself, are being used by multinational companies Penta and Eureko to try and force the Slovak government to pay compensation for reversing health privatisation and liberalisation policies. Similar action has been used against the Polish government by Eureko to win compensation worth nearly 2 billion Euros and a policy commitment to further privatisation.