Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge

By Zegordi S.H.   Itoh K.   Enkawa T.  

European Journal of Operational Research, Vol. 85, Iss. 3, 1995-09 ,pp. : 515-531

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

A tabu search approach for the flow shop scheduling problem

By Ben-Daya M.   Al-Fawzan M.  

European Journal of Operational Research, Vol. 109, Iss. 1, 1998-08 ,pp. : 88-95

Elsevier

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

A contribution to the stochastic flow shop scheduling problem

By Gourgand M.   Grangeon N.   Norre S.  

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

Elsevier

Access to resources Recommend Favorite