Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.