Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions

Author： FranÇa P. M.   Tin G.   Buriol L. S.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.44, Iss.5, 2006-03, pp. : 939-957

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

Studying the effect of different combinations of timetabling with sequencing algorithms to solve the no-wait job shop scheduling problem

By Samarghandi Hamed   ElMekkawy Tarek Y.   Ibrahem Al-Mehdi M.  

International Journal of Production Research, Vol. 51, Iss. 16, 2013-08 ,pp. : 4942-4965

Taylor & Francis Ltd

Access to resources Recommend Favorite

A meta-heuristic approach for solving the no-wait flow-shop problem

By Samarghandi Hamed   ElMekkawy Tarek Y.  

International Journal of Production Research, Vol. 50, Iss. 24, 2012-12 ,pp. : 7313-7326

Taylor & Francis Ltd

Access to resources Recommend Favorite

A novel hybrid meta-heuristic algorithm for a no-wait flexible flow shop scheduling problem with sequence dependent setup times

By Jolai F.  

International Journal of Production Research, Vol. 50, Iss. 24, 2012-12 ,pp. : 7447-7466

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

Two MILP models for the N × M SDST flowshop sequencing problem

By Tseng F. T.   Stafford E. F.  

International Journal of Production Research, Vol. 39, Iss. 8, 2001-05 ,pp. : 1777-1809

Taylor & Francis Ltd

Access to resources Recommend Favorite