ECCO XVI - Overall Program Schedule

Molde 5-7 june 2003

Each plenary is 1 hour. Other presentations are 30 minutes.
Please leave 5 minutes for discussions and transfer

Thursday - June 5^th

Friday – June 6^th

Saturday – June 7^th

Room

108

112

B138

Room

108

112

B138

Room

108

112

B138

9:00

Introduction

9:00

Plenary – Wallace

9:15

Plenary – LePape

9:15

Plenary - Formanowicz

10:00

Coffe

10:15

Coffee

10:15

Coffe

10:30

Sess F1

Sess F2

10:45

Sess S1

Sess S2

10:45

Sess T1

Sess T2

12:00

Lunch

12:15

Lunch

12:15

Lunch

13:15

Sess F4

Sess F5

13:15

End of Conference

13:30

Sess T4

Sess T5

ILOG – I

14:45

Coffee

15:00

Coffee

15:15

Sess F7

Sess F8

15:30

Sess T7

Sess T8

ILOG - II

16:45

End of Scientific Program

17:00

End of Scientific Program

19:00

Reception at the Town Hall

19:00

Conference Dinner

Coffe will be served in the main hallway

Lunch Thursday, Friday and Saturday is served in rooms B139/B140 (new building)

All plenaries are in room 108 (main building)

Other presentations are in rooms 108, 112 (main) building and B138 (new building)

ILOG will be in Room 202 (main building)

Thursday June 5^th

9:00 – 9:15 Opening

9:15 – 10:15 Plenary Chair – Silvano Martello

Piotr Formanowicz.
On some combinatorial problems of computational biology

10:15 – 10:45 Coffee

10:45 – 12:15 T1 – Heuristics Chair – Ivo Bloechiger

10:45 Ivo Bloechliger.
A partial feasible solution approach to vertex
coloring

11:15 Toshihide Ibaraki, Shinji Imahori and Mutsunori Yagiura.
Improved Local Search Algorithms for the Rectangle
Packing Problem with General Spatial Costs

11:45 Rafal Walkowiak.
A simulated annealing approach for multi-container
loading problem

10:45 – 12:15 T2 – Scheduling Chair – Ondrej Cepek

10:45 Tadeusz Sawik.
Simultaneous vs. Sequential Loading and Scheduling of a
Hybrid Flowshop with Parallel Multi-Capacity Machines

11:15 Paulo M. França, Gilberto Tin Jr. and Luciana S. Buriol.
Genetic Algorithms for the No-Wait Flowshop Sequencing
Problem with Time Restrictions.

11:45 Ondrej Cepek, Petr Cap and Filip Convicka.
Minimizing makespan in a two machine no-wait
flowshop with precedence constraints.

12:15 – 13:30 Lunch

13:30 – 15:00 T4 - Heuristics Chair – Arne Løkketangen

13:30 Halvard Arntzen and Arne Løkketangen.
Experiments with an Adaptive Memory Search
Heuristic for a University Timetabling Problem

14:00 J.D. Landa Silva and E.K. Burke.
Cooperative Local Search

14:30 Noureddine Bouhmala.
A Multilevel GSAT for Random Constraint
Satisfaction Problems - CANCELLED

13:30 – 15:00 T5 – Netw. + Heur Chair – Geir Hasle

13:30 Pietro Belotti and Federico Malucelli.
Solving a difficult network design problem through
Lagrangian Relaxation

14:00 Sacha Varone.
Autonomous Wireless LAN management

14:30 Atle Riise.
Adaptive operator selection in variable
neighbourhood search.

13:30 – 15:00 T6 – Tutorial ILOG Tutorial I

15:00 – 15:30 Coffee

15:30 – 17:00 T7 – Log and Manu Chair – Grzegorz Pawlak

15:30 Ekrem Duman.
Workload Balancing in Printed Circuit Board Assembly
Shops

16:00 Grzegorz Pawlak and Jacek Blazewicz.
Minimize the makespan in FMS’s with cyclic transportation

16:30 Silvano Martello and Paolo Toth.
An Exact Algorithm for the Two-Constraint 0-1 Knapsack
Problem

15:30 – 17:00 T8 - Scheduling Chair – Erwin Pesch

15:30 Salvatore Nocella, Fabrizio Rossi and Stefano Smriglio.
A time indexed formulation for scheduling commands on a
satellite constellation.

16:00 Erwin Pesch and Tamas Kis.
A survey on exact methods for the multiprocessor
flowshop problem.

16:30 Victor V. Chistiakov.
Queeing the renovation of complex n >> 1
enterprises with strongly varying input – outputs
- CANCELLED

15:30 – 17:00 T9 – Tutorial ILOG Tutorial II

19:00 Reception at the Town Hall

Friday June 6^th

9:00 – 10:00 Plenary Chair – Jacques Desrosiers

Stein W. Wallace.
The role of stochastics in optimization:
Why it is dangerous to overlook it.

10:00 – 10:30 Coffee

10:30 – 12:00 F1 – Routing Chair – Atle Riise

10:30 J. Desrosiers, N. Bélanger, G. Desaulniers and F. Soumis.
Fleet Assignment with Time Windows, Spacing Constraints
and Time Dependent Profits

11:00 L. M. Gambardella, N, Casagrande, R. Mantemanni,
F. Oliverio and Andrea Rizzoli.
Ant Colony Optimization applied to industrial vehicle
routing problems.

11:30 Geir Hasle.
Heuristics for Rich VRP Models.

10:30 – 12:00 F2 – Gen + Sched Chair – Marek Mika

10:30 Quingfu Zhang, Hui Li and Edvard Tsang.
Estimation of Distribution Algorithm with Local Search for
Approximating the Discrepancy of a Finite Set of Points

11:00 Marek Mika, Grzegorz Waligóra and Jan Węglarz.
Scatter search for the resource-constrained project
scheduling problem

11:30 J. J. Salazar González, Frederic Semet and Gilbert Laporte.
Algorithms for the Job Sequencing and
Tool Switching Problem.

12:00 – 13:15 Lunch

13:15 – 14:45 F4 - Routing Chair – Øyvind Halskau Sr.

13:15 Irina Gribkovskaia and Øyvind Halskau Sr.
Heuristics for the pick-up and delivery problem with one
vehicle and non-Hamiltonian routes.

13:45 Yingyu Wan, Fred Mtenzi and Bing Wu.
A best-possible approximation for minimum-energy
multicast problem in wireless ad hoc networks

14:15 Natalia V. Shakhlevich and Vitaly A. Strusevich.
Coordinating Supply and Production Schedules via
Controllable Release and Processing Parameters

13:15 – 14:45 F5 - Heuristics Chair – Colin Reeves

13:15 Olivier Hudry and Irene Charon.
The "descent with mutations" metaheuristic

13:45 C. K. Y. Lin and R. C. W. Kwok.
Integrated Location, Routing and Assignment Model with
Multiple Objectives

14:15 Colin R. Reeves.
Some Probability Puzzles arising in the Application of
Multi-Start Local Search

14:45 – 15:15 Coffee

15:15 – 16:45 F7 – Mix Chair – Benjamin Weinberg

15:15 Benjamin Weinberg and El-Ghazali Talbi.
No Doom from No Free Lunch theorem

15:45 Ibrahim H. Osman, Merza Hasan and Ali Abdulla.
Graph Planarization: Exact and LP-based Meta-heuristics.

16:15 C. Pleschiutschnig, R. E. Burkard and J. Zhang.
Inverse 1-Median Problems in the Plane.

19:00 – 23:45 Conference Dinner

Saturday June 7^th

9:15 – 10:10 Plenary Chair – Van-Dat Cung

Claude lePape.
Two Generic Schemes for Efficient
and Robust Cooperative Algorithms

10:15 – 10:45 Coffee

10:45 – 12:15 S1 – Graphs + Gen Chair – John Nolan

10:45 John Nolan.
Computational properties of new classes of graphs
modelling radiocommunications networks

11:15 Van-Dat Cung and Catherine Roucairol.
How to Solve Efficiently NP-hard Combinatorial
Optimization using Grid: the Quadratic Assignment
Problem as an example

11:45 . Tommaso Schiavinotto and Thomas Stützle.
Metaheuristics for the Linear Ordering Problem

10:45 – 12:15 S2 - Scheduling Chair – Christine Strauss

10:45 Dario Pacciarelli and Marco Pranzo.
Production scheduling in a steelmaking-continuous
casting plant.

11:15 Grzegorz Waligóra, Marek Mika and Jan Węglarz.
Scheduling Workflow Applications in Grid Environments

11:45 C. Strauss, C. Doerner, W. Gutjahr,
G. Kotsis and M. Polaschek.
Stochastic Branch and Bound for Workflow Optimisation

12:15 – 13:30 Lunch

13:15 End of conference