Zobrazeno 1 - 1
of 1
pro vyhledávání: '"C5741029320/2020©BEIESP"'
In this paper, a new method is proposed for solving octagonal fuzzy sequencing problem using new ranking method (taking k = 0.5) for converting crisp problem for finding Job sequence of two machine n jobs. The optimality for the completion of the tas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::842b483ff08ec5ab616bffe988551293
https://zenodo.org/record/5580000
https://zenodo.org/record/5580000
