Combining constraint programming and genetic algorithm for dynamic scheduling problems

This paper introduces a new method based on constraint programming (CP) and genetic algorithm (GA) for solving dynamic scheduling problems. The proposed approach allows us to handle scheduling problems with large sizes (i.e. search spaces are too large). Our idea is to break up the search space into...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International Conference on Logistics (Online) s. 19 - 24
Hlavní autori: Elkhyari, Abdallah, Bellabdaoui, Adil
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.04.2017
Predmet:
Anesthesia
Constraint Programming
Dynamic scheduling
Electron tubes
Endoscopes
Genetic algorithms
Medical application
Sociology
Statistics
ISSN:2166-7373
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper introduces a new method based on constraint programming (CP) and genetic algorithm (GA) for solving dynamic scheduling problems. The proposed approach allows us to handle scheduling problems with large sizes (i.e. search spaces are too large). Our idea is to break up the search space into disjoined sub-spaces by the genetic algorithm. To each individual of the population is associated a sub-space. Each sub-space is represented by a sub-CSP which is easier to solve than the original scheduling problem. Our first experimentations are addressed to the Endoscopy Unit scheduling in dynamic way.
ISSN:2166-7373
DOI:10.1109/LOGISTIQUA.2017.7962867