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

Author： Alcaide D.   Rodriguez-Gonzalez A.   Sicilia J.  

Publisher： Elsevier

ISSN： 0377-2217

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

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

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

Formulation of an IP-Based Model for Reactive Flow-Shop Scheduling Problem Subject to Arrival of New Orders

By  

Advanced Materials Research, Vol. 2015, Iss. 1115, 2015-08 ,pp. : 616-621

Trans Tech Publications

Access to resources Recommend Favorite

Solving the continuous flow-shop scheduling problem by metaheuristics

By Fink A.   Vosz S.  

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 400-414

Elsevier

Access to resources Recommend Favorite

Sevast'yanov's algorithm for the flow-shop scheduling problem

By Lourenco H.R.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 176-189

Elsevier

Access to resources Recommend Favorite