z-logo
open-access-imgOpen Access
Modified self-adaptive local search algorithm for a biobjective permutation flow shop scheduling problem
Author(s) -
Çiğdem Alabaş-Uslu,
Berna Dengiz,
Canan AĞLAN,
İhsan SABUNCUOĞLU
Publication year - 2019
Publication title -
turkish journal of electrical engineering and computer sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 30
eISSN - 1303-6203
pISSN - 1300-0632
DOI - 10.3906/elk-1811-40
Subject(s) - flow shop scheduling , heuristics , job shop scheduling , mathematical optimization , permutation (music) , computer science , scheduling (production processes) , pareto principle , pareto optimal , local search (optimization) , tabu search , heuristic , algorithm , multi objective optimization , mathematics , routing (electronic design automation) , physics , computer network , acoustics

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom