Minimizing makespan subject to minimum total flow-time on identical parallel machines

By Gupta J.N.D.   Ruiz-Torres A.J.  

European Journal of Operational Research, Vol. 125, Iss. 2, 2000-09 ,pp. : 370-380

Elsevier

Access to resources Recommend Favorite

Minimizing the makespan for the flow shop scheduling problem with availability constraints

By Aggoune R.  

European Journal of Operational Research, Vol. 153, Iss. 3, 2004-03 ,pp. : 534-543

Elsevier

Access to resources Recommend Favorite

Minimization of the makespan in a two-machine problem under given resource constraints

By Janiak A.  

European Journal of Operational Research, Vol. 107, Iss. 2, 1998-06 ,pp. : 325-337

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