A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times

Author： Cheng J. Steiner G. Stephenson P.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.130, Iss.3, 2001-05, pp. : 559-575

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

A fast tabu search algorithm for the permutation flow-shop problem

By Nowicki E. Smutnicki C.

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

Elsevier

Access to resources Recommend Favorite

An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem

By Xu Ye Wang Ling Wang Shengyao Liu Min

Engineering Optimization, Vol. 46, Iss. 9, 2014-09 ,pp. : 1269-1283

Taylor & Francis Ltd

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

On three-machine flow shops with random job processing times

By Kamburowski J.

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

Elsevier

Access to resources Recommend Favorite

A bicriteria two-machine permutation flowshop problem

By Sivrikaya-Serifoglu F. Ulusoy G.

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

Elsevier

Access to resources Recommend Favorite