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

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

On minimizing resource consumption with constraints on the makespan and the total completion time

By Vasilev S.H.   Foote B.L.  

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 612-621

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

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