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 describes the implementation of Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithm to minimize the total completion time of jobs called makespan in parallel line Job Shop Scheduling Problem (PJSSP). PJSSP is one of the scheduling methods in manufacturing industry for increasing plant utilization, reducing cycle time and to find the optimal allocation of jobs in multiple processing lines. Each job is assigned to a particular line and the job should be completed only in that assigned line. Also, the job should be processed in a particular order. PJSSP is always a challenging task in the combinatorial research and it requires a heuristic approach. Results show that the performance of PSO is superior to GA in order to find optimal solution with minimum makespan for PJSSP.

A Comparison of Genetic Algorithm and Particle Swarm Optimisation to Minimize the Makespan for Parallel Line Job Shop Scheduling