3 présentations

• 
  10h30 - 10h55

  The Prepacking Problem

  • Éric Prescott Gagnon, JDA Software
  • Louis-Martin Rousseau, prés., Polytechnique Montréal
  • Gabrielle Gauthier Melançon, JDA Software
  • Maxim Hoskins, Polytechnique Montréal
  • Renaud Masson, Polytechnique Montréal
  • Jorge E. Mendoza, Université Catholique de l'Ouest
  • Christophe Meyer, Université du Québec à Montréal

  The prepacking problem consists in putting a product of different sizes, for instance T-Shirts, into packs sent to stores to satisfy demand. However, to reduce costs, the number of different pack configurations is limited. Different approaches were tried such as a MIP, constraint programming and a heuristic.

• 
  10h55 - 11h20

  Dynamic Task Assignment in a Warehouse

  • Éric Prescott Gagnon, prés., JDA Software
  • Antoine Legrain, Polytechnique Montréal
  • Louis-Martin Rousseau, Polytechnique Montréal

  A warehouse is a highly dynamic environment where tasks are created, modified and canceled as trucks come and go and things are moved around. The dynamic task assignment problem consists in assigning a new task to an employee based on productivity criteria.

• 
  11h20 - 11h45

  Optimization in Fashion Assortment Planning

  • Éric Prescott Gagnon, JDA Software
  • Vincent Raymond, prés., JDA Software
  • Marc Brisson, JDA Software
  • Marie-Claude Côté, JDA Software
  • Gabrielle Gauthier Melançon, JDA Software

  Planning an assortment in fashion consists in selecting the best set of items to be carried in each store of a chain for a future season based on user-defined constraints. To solve this problem, a genetic algorithm, a MIP model and new approaches to create new items have been developed.

  The slides are in English but will be presented in French.