English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper proposes, a multi-objective optimization of minimizing makespan and total flow time of jobs for permutation flow shop scheduling is considered. Bi-objective issues are comprehended by doling out uniform weight to every objective function in view of its preference or determining every competent solutions. In flow shop scheduling environment, many meta-heuristic algorithms have been used to find optimal or near-optimal solutions due to the computational cost of determining exact solutions. This work provides a hybridization of genetic algorithm and simulated annealing algorithm (HGASA) based multi-objective optimization algorithm for flow shop scheduling. HGASA could be a simple and proficient algorithm that is utilized to determine for every single and multi-objective problem in flow shop scheduling shop environment. This algorithm can works simply for realistic manufacturing system applications. The proposed hybrid algorithm searches the optimal solution for objectives by considering the makespan and total flow time. The performance of the proposed HGASA was tested on standard flow shop benchmark problems to calculate its performance. The test results show that the HGASA algorithm performed better in terms of searching quality and efficiency than other meta-heuristic algorithms.

A Hybrid Algorithm for Multi-Objective Optimization of Minimizing Makespan and Total Flow Time in Permutation Flow Shop Scheduling Problems