|
|
Detailed schedule
Click on a link for more details
Show all the abstracts
Thursday 30 January:
Thursday 11:15-12:30 TA-1: COMEX - Optimization 1 Room Vesale 023 - Chair: M. Schyns
Thursday 11:15-12:30 TA-2: Software and Implementation Room Vesale 020 - Chair: M. Mezmaz
Thursday 11:15-12:30 TA-3: COMEX - Smart mobility Room Vesale 025 - Chair: A. Caris
Thursday 11:15-12:30 TA-4: Systems Room Pentagone 0A11 - Chair: P. Kunsch
Thursday 14:00-15:40 TB-1: Data Analysis 1 Room Vesale 023 - Chair: X.Siebert
Thursday 14:00-15:40 TB-2: Multiple Objectives Room Vesale 020 - Chair: Y. de Smet
Thursday 14:00-15:40 TB-3: Logistics Room Vesale 025 - Chair: D. De Wolf
Thursday 14:00-15:40 TB-4: COMEX - Applications to Economy Room Pentagone 0A11 - Chair: W. Brauers
Thursday 14:00-15:40 TB-5: Networks Room Pentagone 0A07 - Chair: B. Fortz
Thursday 16:10-17:25 TC-1: Mixed-integer nonlinear programming Room Vesale 023 - Chair: Y. Crama
Thursday 16:10-17:25 TC-2: Decision Analysis 1 Room Vesale 020 - Chair: S. Eppe
Thursday 16:10-17:25 TC-3: Routing Room Vesale 025 - Chair: K. Sörensen
Thursday 16:10-17:25 TC-4: Graphs Room Pentagone 0A11 - Chair: H. Mélot
Thursday 16:10-17:25 TC-5: Scheduling Room Pentagone 0A07 - Chair: S. Hanafi
- Dynamic Programming for Scheduling Locks in Sequence
Ward Passchyn (KU Leuven) Co-authors: F.C.R. Spieksma
- A Combinatorial Benders' decomposition for the lock scheduling problem
Jannes Verstichel (KU Leuven campus Gent) Co-authors: Joris Kinable, Patrick De Causmaecker, Greet Vanden Berghe
- A dynamic programming algorithm for a robotic cell problem with batch transfer
Nacira Chikhi (USTHB /AMCD&RO UVHC/LAMIH) Co-authors: M. Abbas, A. Bekrar, R. Benmansour and S.Hanafi Abstract: In this paper, we study a robotic cell problem and precisely a robotic ?ow shop problem with two dedicated machines at the ?rst stage and a common machine at the second stage. We have two types of jobs where each job has to be processed on one dedicated machine at the ?rst stage and then on the common machine. The jobs
are transported from the ?rst stage to the second one and the robot can carry up at most c jobs in one shipment. There are several applications of this problem in ?exible manufacturing systems. The main contribution of this study, is to propose exact and approximate methods for the robotic cell problem. The objective is to ?nd a joint schedule of production and transportation such that the makespan is minimized. We prove the NP-hardness of a special case of the general problem. We also provide polynomial time algorithms for some particular problems where the processing times are identical on the ?rst stage. Then, we develop a dynamic programming algorithm to solve optimally this general case. The experiments show the e?ciency of our algorithms.
Friday 9:00-10:15 FA-1: Queuing Room Vesale 023 - Chair: S. Wittevrongel
Friday 9:00-10:15 FA-2: Decision Analysis 2 Room Vesale 020 - Chair: R. Bisdorff
Friday 9:00-10:15 FA-3: COMEX - Optimization 2 Room Vesale 025 - Chair: M. Labbé
Friday 9:00-10:15 FA-4: Production Room Pentagone 0A11 - Chair: D. Tuyttens
Friday 14:00-15:40 FB-1: Data Analysis 2 Room Vesale 023 - Chair: P. Fortemps
Friday 14:00-15:40 FB-2: Heuristics Room Vesale 020 - Chair: T. Stützle
Friday 14:00-15:40 FB-3: COMEX - Transportation Room Vesale 025 - Chair: F. Spieksma
Friday 14:00-15:40 FB-4: Health Room Pentagone 0A11 - Chair: G. Vanden Berghe
|
|