A tabu search approach for group scheduling in buffer-constrained flow shop cells

Author： Solimanpur Maghsud   Elmi Atabak  

Publisher： Taylor & Francis Ltd

ISSN： 1362-3052

Source： International Journal of Computer Integrated Manufacturing, Vol.24, Iss.3, 2011-03, pp. : 257-268

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

An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search

By Dauzère-Pérès S.   Paulli J.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 281-306

Springer Publishing Company

Access to resources Recommend Favorite

Tardiness minimization in a flexible job shop: A tabu search approach

By Scrich Cintia Rigão   Armentano Vinícius Amaral   Laguna Manuel  

Journal of Intelligent Manufacturing, Vol. 15, Iss. 1, 2004-02 ,pp. : 103-115

Springer Publishing Company

Access to resources Recommend Favorite

Prototyped genetic search: a cybernetical approach to job-shop scheduling problems

By Khoukhi Amar  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 31, Iss. 1, 2002-02 ,pp. : 96-114

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A tabu search algorithm based on new block properties and speed-up method for permutation flow-shop with finite intermediate storage

By Li Shaohua   Tang Lixin  

Journal of Intelligent Manufacturing, Vol. 16, Iss. 4-5, 2005-10 ,pp. : 463-477

Springer Publishing Company

Access to resources Recommend Favorite

Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion

By Gupta J. N. D.   Palanimuthu N.   Chen C-L.  

Production Planning and Control, Vol. 10, Iss. 3, 1999-04 ,pp. : 251-265

Taylor & Francis Ltd

Access to resources Recommend Favorite