A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. - Jinliang Cheng; George Steiner; Paul Stephenson (Eur. J. Oper. Res., 2001)

Fast fully polynomial approximation schemes for minimizing completion time variance. - Wieslaw Kubiak; Jinliang Cheng; Mikhail Y. Kovalyov (Eur. J. Oper. Res., 2002)

A half-product based approximation scheme for agreeably weighted completion time variance. - Jinliang Cheng; Wieslaw Kubiak (Eur. J. Oper. Res., 2005)