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

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

A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

By Riane F.   Artiba A.   E. Elmaghraby S.  

European Journal of Operational Research, Vol. 109, Iss. 2, 1998-09 ,pp. : 321-329

Elsevier

Access to resources Recommend Favorite

An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns

By Alcaide D.   Rodriguez-Gonzalez A.   Sicilia J.  

European Journal of Operational Research, Vol. 140, Iss. 2, 2002-07 ,pp. : 384-398

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