An Efficient Memetic Algorithm for Dynamic Flexible Job Shop Scheduling with Random Job Arrivals

Publisher： IGI Global_journal

E-ISSN： 1942-9037|5|1|63-77

ISSN： 1942-9045

Source： International Journal of Software Science and Computational Intelligence (IJSSCI), Vol.5, Iss.1, 2013-01, pp. : 63-77

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 memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

By Frutos Mariano  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 745-765

Springer Publishing Company

Access to resources Recommend Favorite

A dispatching algorithm for flexible job-shop scheduling with transfer batches: an industrial application

By Calleja Gema   Pastor Rafael  

Production Planning and Control, Vol. 25, Iss. 2, 2014-01 ,pp. : 93-109

Taylor & Francis Ltd

Access to resources Recommend Favorite

A multi-objective genetic algorithm for fuzzy flexible job-shop scheduling problem

By Wang Xiaojuan   Gao Liang   Zhang Chaoyong   Li Xinyu  

International Journal of Computer Applications in Technology, Vol. 45, Iss. 2-3, 2012-12 ,pp. : 115-125

Inderscience Publishers

Access to resources Recommend Favorite

A genetic algorithm-based approach for job shop scheduling

By Phanden Rakesh Kumar   Jain Ajai   Verma Rajiv  

Journal of Manufacturing Technology Management, Vol. 23, Iss. 7, 2012-09 ,pp. : 937-946

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

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