During the last decades, hundreds of approximate algorithms have been proposed in literature addressing flow-shop-based scheduling problems. In race for finding best proposals to solve these problems, speed-up procedures compute objective functions represent a key factor efficiency algorithms. This is case well-known Taillard’s accelerations traditional flow shop with makespan minimisation or s...

The long-term results of the key grip procedure (tenodesis of the flexor pollicis longus tendon to the radius, release of the A1 pulley, and percutaneous pin fixation of the interphalangeal joint of the thumb) were evaluated in 10 tetraplegic patients. Seven patients also had tenodesis of the extensor pollicis longus and brevis tendons to prevent flexion at the metacarpophalangeal (MP) joint. P...

This paper summarizes work on a general bottomup procedure for searching AND/OR graphs which includes a number of procedures for searching AND/OR graphs, state-space graphs, and dynamic programming procedures as its special cases. The paper concludes with comments on the significance of this work in the context of the author’s unified approach to search procedures.