Topic
Genetic algorithm scheduling
About: Genetic algorithm scheduling is a research topic. Over the lifetime, 3265 publications have been published within this topic receiving 78070 citations.
Papers published on a yearly basis
1 / 2
Papers
TL;DR: A classification scheme is provided, i.e. a description of the resource environment, the activity characteristics, and the objective function, respectively, which is compatible with machine scheduling and which allows to classify the most important models dealt with so far, and a unifying notation is proposed.
1,624 citations
TL;DR: A general genetic algorithm to address a wide variety of sequencing and optimization problems including multiple machine scheduling, resource allocation, and the quadratic assignment problem is presented.
Abstract: In this paper we present a general genetic algorithm to address a wide variety of sequencing and optimization problems including multiple machine scheduling, resource allocation, and the quadratic assignment problem. When addressing such problems, genetic algorithms typically have difficulty maintaining feasibility from parent to offspring. This is overcome with a robust representation technique called random keys. Computational results are shown for multiple machine scheduling, resource allocation, and quadratic assignment problems. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
1,521 citations
TL;DR: The fundamental approaches for scheduling under uncertainty: reactive scheduling, stochastic project scheduling, fuzzy project Scheduling, robust (proactive) scheduling and sensitivity analysis are reviewed.
1,020 citations
TL;DR: A genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP) integrates different strategies for generating the initial population, selecting the individuals for reproduction and reproducing new individuals to prove that genetic algorithms are effective for solving FJSP.
971 citations
TL;DR: It is shown that the performance-ranking of priority rules does not differ for single-pass scheduling and sampling, that sampling improves the performance of single- pass scheduling significantly, and that the parallel method cannot be generally considered as superior.
756 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 2 |
| 2024 | 3 |
| 2023 | 17 |
| 2022 | 24 |
| 2019 | 5 |
| 2018 | 15 |