Integer programming-based decomposition approaches for solving machine scheduling problems

Integer programming-based decomposition approaches for solving machine scheduling problems

The aim in this thesis is to develop efficient enumeration algorithms to solve certain strongly NP-hard scheduling problems. These algorithms were developed using a combination of ideas from Integer Programming, Constraint Programming and Scheduling Theory. In order to combine different techniques i...

Full description

Bibliographic Details
Main Author: Sadykov, Ruslan
Format: Others
Language:en
Published: Universite catholique de Louvain 2006
Subjects:
Interval-indexed formulation
Dantzing-Wolfe decomposition
Generic Benders decomposition
Time-indexed formulation
Branch-and-check
No-good cuts
Edge-finding
Online Access:http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-06232006-155952/

Internet

http://edoc.bib.ucl.ac.be:81/ETD-db/collection/available/BelnUcetd-06232006-155952/

Similar Items