1999
DOI: 10.1162/evco.1999.7.1.1
|View full text |Cite
|
Sign up to set email alerts
|

Production Scheduling and Rescheduling with Genetic Algorithms

Abstract: A general model for job shop scheduling is described which applies to static, dynamic and non-deterministic production environments. Next, a Genetic Algorithm is presented which solves the job shop scheduling problem. This algorithm is tested in a dynamic environment under different workload situations. Thereby, a highly efficient decoding procedure is proposed which strongly improves the quality of schedules. Finally, this technique is tested for scheduling and rescheduling in a non-deterministic environment.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
115
0
11

Year Published

2005
2005
2017
2017

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 238 publications
(127 citation statements)
references
References 2 publications
1
115
0
11
Order By: Relevance
“…NEH for flows shop scheduling [136], and shifting bottleneck [119] for job shop scheduling, are developed to search for "good enough" solutions within a reasonable computational times. Meta-heuristics such as tabu search [106], genetic algorithm [16], particle swarm optimisation [126] have also been applied extensively to solve production scheduling problems.…”
Section: Production Schedulingmentioning
confidence: 99%
See 1 more Smart Citation
“…NEH for flows shop scheduling [136], and shifting bottleneck [119] for job shop scheduling, are developed to search for "good enough" solutions within a reasonable computational times. Meta-heuristics such as tabu search [106], genetic algorithm [16], particle swarm optimisation [126] have also been applied extensively to solve production scheduling problems.…”
Section: Production Schedulingmentioning
confidence: 99%
“…Other heuristics based on understandings of problem domains have been also proposed in the literature such as shifting bottlenecks [5]. More general techniques based on meta-heuristics such as tabu search [106] and genetic algorithm [16] have been developed to deal with different production scheduling problems and show promising results. However, it is noted that designing a good heuristic is not a trivial task and it can be very time consuming and requires a lot of problem domain knowledge.…”
Section: Introductionmentioning
confidence: 99%
“…This new starting solution must be first updated to the new problem, by deleting the operations already started. Starting with an already "good" solution, together with the reduction in the search space, will decrease the runtime needed to provide the new solution [11]. It is also necessary to adjust different algorithm parameters, like for example crossover operator and mutation rate in the case of genetic algorithms, to adapt to the new situation.…”
Section: Optimisation Engine Design and User Interactionmentioning
confidence: 99%
“…The development of techniques for incrementally managing schedules in response to execution status updates has received attention in the AI community (Smith, 1994;Zweben et al, 1994;Bierwirth and Mattfeld, 1999;Chien et al, 2000;El Sakkout and Wallace, 2000;Kramer and Smith, 2004). The approach taken in the DS descends from Smith (1994) and combines the use of strong domain heuristics with local repair-based search techniques to strike a balance between optimization and solution stability.…”
Section: Article In Pressmentioning
confidence: 99%
“…The approach taken in the DS descends from Smith (1994) and combines the use of strong domain heuristics with local repair-based search techniques to strike a balance between optimization and solution stability. Other work (e.g., Zweben et al, 1994;Bierwirth and Mattfeld, 1999;Chien et al, 2000), places greater reliance on broader searchbased processes, which also provides a basis for efficient, ''anytime'' scheduler response but with less emphasis on minimizing change.…”
Section: Article In Pressmentioning
confidence: 99%