2002•Unpublished venueRequires access

A genetic algorithm for realistic resource scheduling

Felipe Luís Beck, Christoph S. Thomalla

Abstract

Optimal resource scheduling is a hard problem, the best known of which is the classical job shop scheduling problem. But it lacks various characteristics of real-world scheduling problems, limiting the use of tools used to solve it. We include some of these characteristics and present the development and implementation of an optimization methodology for scheduling jobs based on a genetic algorithm (GA). The results for some known test examples are shown.

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: Computer science, Fair-share scheduling, Flow shop scheduling, Dynamic priority scheduling, Rate-monotonic scheduling, Genetic algorithm scheduling, Two-level scheduling, Limiting