2005•Unpublished venueRequires access

Genetic algorithms for solving scheduling problems in flexible manufacturing cells

António Manuel Pereira Ferrolho, Manuel M. Crisostomo

Abstract

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling, flow-shop scheduling and job-shop scheduling). The practical results obtained from the FMC for the various scheduling problems show the efficiency of GA in solving these problems.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Flow shop scheduling, Fair-share scheduling, Job shop scheduling, Dynamic priority scheduling, Two-level scheduling, Rate-monotonic scheduling, Genetic algorithm scheduling, Computer science