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

A Method of Constructing Genetic Algorithm for a Scheduling Problem in Two Processes with Parallel Machines Osamu MITSUI*, Hitoshi IIMA* and Nobuo SANNOMIYA* This paper deals with a scheduling problem in a flow shop process with parallel machines. The objective of this problem is to minimize the makespan, and the problem has complicated constraints. We propose two kinds of genetic algorithm to solve the problem. By examining numerical results, a comparison is made between them from the viewpoint of accuracy.