An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

By Della Croce F.   Ghirardi M.   Tadei R.  

European Journal of Operational Research, Vol. 139, Iss. 2, 2002-06 ,pp. : 293-301

Elsevier

Access to resources Recommend Favorite

A general lower bound for the makespan problem

By Webster S.T.  

European Journal of Operational Research, Vol. 89, Iss. 3, 1996-03 ,pp. : 516-524

Elsevier

Access to resources Recommend Favorite

Bounds for the position of the smallest job in completion time variance minimization

By Manna D.K.   Prasad V.R.  

European Journal of Operational Research, Vol. 114, Iss. 2, 1999-04 ,pp. : 411-419

Elsevier

Access to resources Recommend Favorite

Fast fully polynomial approximation schemes for minimizing completion time variance

By Kubiak W.   Cheng J.   Kovalyov M.Y.  

European Journal of Operational Research, Vol. 137, Iss. 2, 2002-03 ,pp. : 303-309

Elsevier

Access to resources Recommend Favorite

V-shape property for job sequences that minimize the expected completion time variance

By X. C.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 118-123

Elsevier

Access to resources Recommend Favorite