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

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

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

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

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

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

A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem

By Sahin Ramazan   Turkbey Orhan  

International Journal of Production Research, Vol. 47, Iss. 24, 2009-02 ,pp. : 6855-6873

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

Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems

By Zolfaghari S.   Liang M.  

International Journal of Production Research, Vol. 40, Iss. 9, 2002-06 ,pp. : 2141-2158

Taylor & Francis Ltd

Access to resources Recommend Favorite