ATTENTION/WARNING - NE PAS DÉPOSER ICI/DO NOT SUBMIT HERE

Ceci est la version de TEST de DIAL.mem. Veuillez ne pas soumettre votre mémoire sur ce site mais bien à l'URL suivante: 'https://thesis.dial.uclouvain.be'.
This is the TEST version of DIAL.mem. Please use the following URL to submit your master thesis: 'https://thesis.dial.uclouvain.be'.
 

Solving industrial scheduling problems with Constraint Programming and insertion sequence variables

Gelders, Julien ; Legrand, Emma ; Van Meerbeeck, Damien
(2023)

Files

Gelders_51761800_Legrand_22031800_VanMeerbeeck_28231600_2023.pdf
  • Open access
  • Adobe PDF
  • 2.03 MB
Download

Details

Supervisors
Schaus, Pierre
Faculty
Ecole polytechnique de Louvain
Degree label
Master [120] : ingénieur civil en informatique, à finalité spécialisée
Abstract
Over the years, extensive research has been conducted on various optimization problems such as vehicle routing problems, scheduling problems, and more. In our case, we are interested in the Job-Shop problem, which has already been widely researched in the literature. Many techniques have been proposed to improve the results for large-scale problems where the exact solution is unknown. Some notable approaches include Tabu search, Genetic algorithms, Dynamic programming, among others. One technique of particular interest to us is Constraint Programming, which is commonly used to model and solve optimizations problems. Recently, a new variable called the sequence variable has been introduced, primarily for modeling routing problems such as the Dial-a-Ride Problem (DARP) and the Patient Transportation Problem (PTP). The objective of this master’s thesis is to investigate the potential of using the sequence variable to efficiently model scheduling problems and find optimal solutions. To this end, we will explore whether this variable can improve the modeling capabilities and performance of Constraint Programming in solving the Job-Shop problem.