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

Author： Gupta J. N. D.   Palanimuthu N.   Chen C-L.  

Publisher： Taylor & Francis Ltd

ISSN： 1366-5871

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

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 Advanced Tabu Search Algorithm for the Job Shop Problem

By Nowicki Eugeniusz   Smutnicki Czesław  

Journal of Scheduling, Vol. 8, Iss. 2, 2005-04 ,pp. : 145-159

Springer Publishing Company

Access to resources Recommend Favorite

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

By Schuurman P.   Woeginger G.J.  

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 105-122

Elsevier

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

Scheduling a two-stage hybrid flow shop with parallel machines at the first stage

By Gupta J.N.D.   Hariri A.M.A.   Potts C.N.  

Annals of Operations Research, Vol. 69, Iss. 1, 1997-01 ,pp. : 171-191

Springer Publishing Company

Access to resources Recommend Favorite

Performance Comparison of Cuckoo Search Algorithm to Solve the Hybrid Flow Shop Scheduling Benchmark Problems with Makespan Criterion

By  

International Journal of Swarm Intelligence Research (IJSIR), Vol. 7, Iss. 2, 2016-04 ,pp. : 1-14

IGI Global_journal

Access to resources Recommend Favorite