This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | |||
en:research [2013/10/06 10:10] – mserairi | en:research [2013/10/06 18:08] (current) – mserairi | ||
---|---|---|---|
Line 1: | Line 1: | ||
- | ====== Bin-Packing | + | ====== Main research interests ====== |
+ | ===== Bin-Packing ===== | ||
* Variable Sized Bin-Packing Problem | * Variable Sized Bin-Packing Problem | ||
* Two-Dimensional Bin-Packing Problem | * Two-Dimensional Bin-Packing Problem | ||
- | + | ===== Two-Machine Scheduling ===== | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | ====== Two-Machine Scheduling | + | |
* Two-Machine Flow Shop Problem with Setup-Times | * Two-Machine Flow Shop Problem with Setup-Times | ||
* Two-Machine Flow Shop Problem with Communication Delays | * Two-Machine Flow Shop Problem with Communication Delays | ||
* Two-Machine Open Shop Problem under Resource Constraints | * Two-Machine Open Shop Problem under Resource Constraints | ||
- | + | ===== Algorithmics in Graph Theory ===== | |
- | ====== Algorithmics in Graph Theory | + | |
* Minimum Sum Coloring Problem | * Minimum Sum Coloring Problem |