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

A tight lower bound for the completion time variance problem

By Ng C.T.   Cai X.   Cheng T.C.E.  

European Journal of Operational Research, Vol. 92, Iss. 1, 1996-07 ,pp. : 211-213

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

Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date

By Gowrishankar K.   Rajendran C.   Srinivasan G.  

European Journal of Operational Research, Vol. 132, Iss. 3, 2001-08 ,pp. : 643-665

Elsevier

Access to resources Recommend Favorite

Total completion time minimization in two-machine job shops with unit-time operations

By Kubiak W.   Timkovsky V.  

European Journal of Operational Research, Vol. 94, Iss. 2, 1996-10 ,pp. : 310-320

Elsevier

Access to resources Recommend Favorite