Journées de l'optimisation 2018

HEC Montréal, Québec, Canada, 7 — 9 mai 2018

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

WA6 Supply chain II

9 mai 2018 10h30 – 12h10

Salle: Serge-Saucier (48)

Présidée par Raf Jans

4 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    Stochastic optimization for material requirement planning (MRP) under demand uncertainty

    • Simon Thevenin, prés., HEC Montréal
    • Yossiri Adulyasak, HEC Montréal
    • Jean-François Cordeau, GERAD - HEC Montréal

    We investigate multiple stochastic optimization formulations for Master Requirement Planning systems under stochastic demand. The execution of the resulting methods is simulated in three environments, which differ by the decisions updated at each period. Results show that these methods lead to significantly lower costs than classical approaches.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    A branch-and-cut algorithm for an assembly routing problem

    • Masoud Chitsaz, prés., HEC Montréal
    • Jean-François Cordeau, GERAD - HEC Montréal
    • Raf Jans, HEC Montréal

    We consider an integrated optimization problem including the production, inventory and inbound transportation decisions where several suppliers each provide a subset of components necessary for the production of a final product. We present several classes of valid inequalities for this problem. Computational experiments show the performance of our branch-and-cut algorithm.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Two-level capacitated facility location with concave costs

    • Aditya Malik, prés., John Molson School of Business
    • Ivan Contreras, Concordia University
    • Navneet Vidyarthi, Concordia University

    We study a two-level capacitated facility location problem with concave costs for production,inventory and transportation. The concave costs assumption represents economies of scale,and hence the resulting problem is an integer concave minimization problem. We compute lower and upper bounds to this problem using Lagrangian relaxation and inner integer approximations.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h45 - 12h10

    Lot-sizing models with simultaneous backlogging and lost sales

    • Raf Jans, prés., HEC Montréal
    • Matthew Arsenault, HEC Montréal

    We study capacitated multi-item lot-sizing models which simultaneously consider the possibility of backlog and lost sales as a means of dealing with a stock-out. We propose new formulations considering several types of interactions between these two types of recourse and by allowing that customers have a different willingness to wait.

Retour