Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server

Author： Hasani Keramat Kravchenko Svetlana A. Werner Frank

ISSN： 0020-7543

Source： International Journal of Production Research, Vol.52, Iss.13, 2014-07, pp. : 3778-3792

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

Related content

Genetic algorithms and simulated annealing for scheduling in agile manufacturing

By Gaafar L.K. Masoud S.A.

International Journal of Production Research, Vol. 43, Iss. 14, 2005-07 ,pp. : 3069-3085

Taylor & Francis Ltd

Access to resources Recommend Favorite

Online algorithms for scheduling two parallel machines with a single server

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol. 22, Iss. 5, 2015-09 ,pp. : 913-927

John Wiley & Sons Inc

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

An efficient hybrid evolutionary heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS

By Yogeswaran M.

International Journal of Production Research, Vol. 47, Iss. 19, 2009-01 ,pp. : 5421-5448

Taylor & Francis Ltd

Access to resources Recommend Favorite

Bicriteria scheduling in a two-machine permutation flowshop

By Lin B. M. T.

International Journal of Production Research, Vol. 44, Iss. 12, 2006-06 ,pp. : 2299-2312

Taylor & Francis Ltd

Access to resources Recommend Favorite