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

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

Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

By Sun X.   Morizawa K.   Nagasawa H.  

European Journal of Operational Research, Vol. 146, Iss. 3, 2003-05 ,pp. : 498-516

Elsevier

Access to resources Recommend Favorite

A Note on optimal allocation of work in stochastic assembly systems

By Rekhi I.   Chand S.   Moskowitz H.  

European Journal of Operational Research, Vol. 137, Iss. 2, 2002-03 ,pp. : 387-393

Elsevier

Access to resources Recommend Favorite

A general lower bound for the makespan problem

By Webster S.T.  

European Journal of Operational Research, Vol. 89, Iss. 3, 1996-03 ,pp. : 516-524

Elsevier

Access to resources Recommend Favorite