A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

Author： Frutos Mariano  

Publisher： Springer Publishing Company

ISSN： 0254-5330

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

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 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

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

By Wang Xiaojuan   Li Wenfeng   Zhang Ying  

International Journal of Computer Applications in Technology, Vol. 47, Iss. 2-3, 2013-06 ,pp. : 280-288

Inderscience Publishers

Access to resources Recommend Favorite

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

By  

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

IGI Global_journal

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

Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach

By      

International Journal of Computer Integrated Manufacturing, Vol. 27, Iss. 8, 2014-08 ,pp. : 733-746

Taylor & Francis Ltd

Access to resources Recommend Favorite