An open shop scheduling problem with a non-bottleneck machine

This paper considers the problem of processing n jobs in a two-machine non-preemptive open shop to minimize the makespan, i.e., the maximum completion time. One of the machines is assumed to be non-bottleneck. It is shown that, unlike its flow shop counterpart, the problem is NP-hard in the ordinary sense. On the other hand, the problem is shown to be solvable by a dynamic programming algorithm that requires pseudopolynomial time. The latter algorithm can be converted into a fully polynomial approximation scheme that runs in time. An O(n log n) approximation algorithm is also designed whi finds a schedule with makespan at most 5/4 times the optimal value, and this bound is tight.

Structural and biological investigation of ferrocene-substituted 3-methylidene-1,3-dihydro-2H-indol-2-ones

The Knoevenagel condensation of 1,3-dihydro-2H-indol-2-one with ferrocene carboxaldehyde afforded an approximate 2:1 mixture of the geometrical isomers (E)- and (Z)-3-ferrocenylmethylidene-1,3-dihydro-2H-indol-2-one respectively in an overall 67% yield; the air and solution-stable isomers were readily separated by preparative thin layer chromatography and their structures were unequivocally elucidated in solution, by (1)H NMR spectroscopy, and in the solid phase, by X-ray crystallography; both isomers of displayed in vitro toxicity against B16 melanoma and Vero cell lines in the micromolar range and inhibited the kinase VEGFR-2 with IC(50) values of ca. 200 nM.