An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.51, Iss.3, 2013-02, pp. : 641-651

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

Applying a hybrid simulated annealing and tabu search approach to non-permutation flowshop scheduling problems

By Lin S. -W. Ying K. -C.

International Journal of Production Research, Vol. 47, Iss. 5, 2009-01 ,pp. : 1411-1424

Taylor & Francis Ltd

Access to resources Recommend Favorite

Parallel flowshop scheduling using Tabu search

By Cao D. Chen M.

International Journal of Production Research, Vol. 41, Iss. 13, 2003-09 ,pp. : 3059-3073

Taylor & Francis Ltd

Access to resources Recommend Favorite

A tabu search algorithm for simultaneous machine/AGV scheduling problem

By Zheng Yan Xiao Yujie Seo Yoonho

International Journal of Production Research, Vol. 52, Iss. 19, 2014-10 ,pp. : 5748-5763

Taylor & Francis Ltd

Access to resources Recommend Favorite

An improved genetic algorithm for the flowshop scheduling problem

By Rajkumar R.

International Journal of Production Research, Vol. 47, Iss. 1, 2009-01 ,pp. : 233-249

Taylor & Francis Ltd

Access to resources Recommend Favorite

A modified harmony search algorithm for the multi-objective flowshop scheduling problem with due dates

By Frosolini M. Braglia M. Zammori F. A.

International Journal of Production Research, Vol. 49, Iss. 20, 2011-10 ,pp. : 5957-5985

Taylor & Francis Ltd

Access to resources Recommend Favorite