HEC Montréal, Canada, 2 - 4 mai 2011

Journées de l'optimisation 2011

HEC Montréal, Canada, 2 — 4 mai 2011

Horaire Auteurs Mon horaire

TA11 Ordonnancement II / Scheduling II

3 mai 2011 10h30 – 12h10

Salle: Rona

Présidée par Gerd Finke

3 présentations

  • 10h30 - 10h55

    An Adaptive Large Neighborhood Search for the National Hockey League Scheduling Problem

    • Elivelton Bueno, prés., École Polytechnique de Montréal
    • Jacques Ferland, Université de Montreal
    • Michel Gendreau, Polytechnique Montréal

    Sports scheduling has provided numerous challenging applications for Combinatorial Optimization techniques. In this talk, we present an Adaptive Large Neighborhood Search algorithm to deal with the scheduling of games for the regular-season of the National Hockey League. In addition to typical scheduling constraints, this application features many specific requirements and raise appealing computational issues. In particular, we address some methodological challenges and present results on computational experiments.

  • 10h55 - 11h20

    Solving the University Examination Timetabling Using a Parallel Hybrid Meta-Heuristics Approach

    • Malek Mouhoub, University of Regina
    • Ali Hmer, prés., Univ. of Regina

    We propose a multi-phase parallel Hybrid meta-heuristics approach, integrating Local Search, Simulated Annealing and Great Deluge algorithms; for solving the University Examination Timetabling. When evaluated on problem instances taken from the ITC 2007 competition, this proposed approach was capable of producing comparable results to those returned by the best solvers.

  • 11h20 - 11h45

    The Identical Coupled-Task Scheduling Problem

    • Gerd Finke, prés., Laboratoire G-SCOP
    • Nadia Brauner, Laboratoire G-SCOP
    • Vassilissa Lehoux-Lebacque, Laboratoire G-SCOP

    General coupled-task problems originate in radar systems. Their complexity status is known with exception of the identical coupled-task case: multiple copies of a two-operation task, where the two operations are separated by a fixed distance, are to be processed with minimal makespan on a single machine. We shall present a polynomial complexity proof for the cyclic case.