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

Author： Gowrishankar K.   Rajendran C.   Srinivasan G.  

Publisher： Elsevier

ISSN： 0377-2217

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date

By Alidaee B.   Dragan I.  

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

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

Scheduling about a given common due date to minimize mean squared deviation of completion times

By Xiaohua W.   Ventura J.A.  

European Journal of Operational Research, Vol. 88, Iss. 2, 1996-01 ,pp. : 328-335

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

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