SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM

Author： Zobolas G. I.   Tarantilis C. D.   Ioannou G.  

Publisher： Taylor & Francis Ltd

ISSN： 1087-6553

Source： Cybernetics and Systems, Vol.40, Iss.4, 2009-05, pp. : 259-285

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

A hybrid genetic algorithm for the job shop scheduling problems

By Park B.J.   Choi H.R.   Kim H.S.  

Computers and Industrial Engineering, Vol. 45, Iss. 4, 2003-12 ,pp. : 597-613

Elsevier

Access to resources Recommend Favorite

A Hybrid Algorithm Using Genetic Algorithm and Cuckoo Search Algorithm to Solve Job Scheduling Problem in Computational Grid Systems

By  

International Journal of Applied Evolutionary Computation (IJAEC), Vol. 7, Iss. 2, 2016-04 ,pp. : 1-11

IGI Global_journal

Access to resources Recommend Favorite

An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 2, Iss. 1, 2011-01 ,pp. : 29-43

IGI Global_journal

Access to resources Recommend Favorite

A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks

By Oĝuz Ceyda   Ercan M.  

Journal of Scheduling, Vol. 8, Iss. 4, 2005-07 ,pp. : 323-351

Springer Publishing Company

Access to resources Recommend Favorite

Local Search Genetic Algorithms for the Job Shop Scheduling Problem

By  

Applied Intelligence, Vol. 21, Iss. 1, 2004-07 ,pp. : 99-109

Springer Publishing Company

Access to resources Recommend Favorite