A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem | Zendy

Mostafa Abouei Ardakan | Zendy; Ali Kourank Beheshti | Zendy; S. Hamid Mirmohammadi | Zendy; Hamed Davari Ardakani | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem

Author(s) -

Mostafa Abouei Ardakan,

Ali Kourank Beheshti,

S. Hamid Mirmohammadi,

Hamed Davari Ardakani

Publication year - 2017

Publication title -

numerical algebra control and optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.303

H-Index - 20

eISSN - 2155-3289

pISSN - 2155-3297

DOI - 10.3934/naco.2017029

Subject(s) - simulated annealing , mathematical optimization , computer science , flow shop scheduling , algorithm , out of kilter algorithm , branch and bound , hybrid algorithm (constraint satisfaction) , population , heuristic , genetic algorithm , job shop scheduling , mathematics , schedule , stochastic programming , theoretical computer science , dijkstra's algorithm , graph , demography , sociology , shortest path problem , constraint programming , constraint logic programming , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research