A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

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.

Mode shape expansion using perturbed force vector approach

A new technique for mode shape expansion in structural dynamic applications is presented based on the perturbed force vector approach. The proposed technique can directly adopt the measured incomplete modal data and include the effect of the perturbation between the analytical and test models. The results show that the proposed technique can provide very accurate expanded mode shapes, especially in cases when significant modelling error exists in the analytical model and limited measurements are available.