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

ISSN： 0020-7543

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

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

Jointly solving the group scheduling and machining speed selection problems: a hybrid tabu search and simulated annealing approach

By Zolfaghari S. Liang M.

International Journal of Production Research, Vol. 37, Iss. 10, 1999-07 ,pp. : 2377-2397

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Gao Jian Chen Rong Deng Wu

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

A hybrid Tabu sample-sort simulated annealing approach for solving distributed scheduling problem

By Chan Felix T.S. Prakash Anuj Ma H.L. Wong C.S.

International Journal of Production Research, Vol. 51, Iss. 9, 2013-05 ,pp. : 2602-2619

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 simulated annealing with multiple‐search paths and parallel computation for a comprehensive flowshop scheduling problem

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 22, Iss. 4, 2015-07 ,pp. : 669-691

John Wiley & Sons Inc

Access to resources Recommend Favorite