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...

Full description

Saved in:
Bibliographic Details
Published in:International Conference on Logistics (Online) pp. 19 - 24
Main Authors: Elkhyari, Abdallah, Bellabdaoui, Adil
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2017
Subjects:
Anesthesia
Constraint Programming
Dynamic scheduling
Electron tubes
Endoscopes
Genetic algorithms
Medical application
Sociology
Statistics
ISSN:2166-7373
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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