MS-Tu-E-43
New models for capacity planning and scheduling

Date: August 11
Time: 16:00--18:30
Room: 4-1

(Note: Click title to show the abstract.)

Organizer:
Leus, Roel (KU Leuven)
Xie, Jinxing (Tsinghua Univ)

Abstract: Scheduling theory has received a wide coverage in the literature on operations research and discrete optimization over the last five decades or so, but the literature seems to have reached a ˇ°sinkˇ± equilibrium with respect to the standard assumptions and parameters to be included in the models. In this symposium we aim to present recent new scheduling models that extend the classic ones, and where the extensions have a direct link with practical operations scheduling in a variety of industries.


MS-Tu-E-43-1
16:00--16:30
Approximate Dynamic Programming Approach for Solving the Stochastic Resource-Constrained Project Scheduling Problems
Li, Haitao (Univ. of Missouri - St. Louis)


MS-Tu-E-43-2
16:30--17:00
An exact algorithm for parallel machine scheduling with conflicts
Leus, Roel (KU Leuven)
Kowalczyk, Daniel (KU Leuven)


MS-Tu-E-43-3
17:00--17:30
MILP formulations for order splitting on a multi-slot machine in the printing industry
Trautmann, Norbert (Univ. of Bern)
Baumann, Philipp (Univ. of California, Berkeley)
Forrer, Salome (Univ. of Bern)


MS-Tu-E-43-4
17:30--18:00
Using combinatorial optimization for large-scale data mining
Baumann, Philipp (Univ. of California, Berkeley)
Hochbaum, Dorit S. (Univ. of California, Berkeley)


MS-Tu-E-43-5
18:00--18:30
Flexible personnel scheduling using branch and price
Brunner, Jens (Univ. of Augsburg)

Return


Footnote:
Code: Type-Date-Time-Room No.
Type : IL=Invited Lecture, SL=Special Lectures, MS=Minisymposia, IM=Industrial Minisymposia, CP=Contributed Papers, PP=Posters
Date: Mo=Monday, Tu=Tuesday, We=Wednesday, Th=Thursday, Fr=Friday
Time : A=8:30-9:30, B=10:00-11:00, C=11:10-12:10, BC=10:00-12:10, D=13:30-15:30, E=16:00-18:00, F=19:00-20:00, G=12:10-13:30, H=15:30-16:00
Room No.: TBA