2016 Optimization Days

HEC Montréal, Québec, Canada, May 2 — 4, 2016

Schedule Authors My Schedule
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MA4 Scheduling

May 2, 2016 10:30 AM – 12:10 PM

Location: Gérard-Parizeau

Chaired by Frédéric Quesnel

4 Presentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10:30 AM - 10:55 AM

    Ré-optimisation des horaires de personnel après une petite perturbation

    • Rachid Hassani, presenter, GERAD
    • Issmail El Hallaoui, GERAD, Polytechnique Montréal

    This talk is about a real-time optimization method to adapt a pre-set schedule after a small perturbation that can result from delay or absence of employees. The method provides schedule's rectification choices to the decision-maker taking into account the immediate and a deterministic future cost.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10:55 AM - 11:20 AM

    A two-phase approach for the multi-department personnel scheduling problem

    • Sarra Souissi, presenter, Polytechnique Montréal

    Generally, large companies are divided into different departments. To avoid hiring new employees, these companies qualify employees to work in different departments. When an employee works outside the department of his primary qualification, we say that he/she is transferred. The proposed solution approach addresses the problem in two phases. The first phase solves independently the problem in each department without considering any transfers. The second phase detects the under-coverings in each department and generate new potential shifts with transfers.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11:20 AM - 11:45 AM

    The bus driver rostering problem with fixed days off

    • Safae Er-Rbib, presenter, GERAD, Polytechnique Montréal

    We consider the problem of assigning duties to bus driver rosters in order to balance as much as possible the weekly working time among the rosters while satisfying various working rules concerning mostly the rest periods between two working days. We model this problem as an integer program and we report computational results obtained on real-world instances.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11:45 AM - 12:10 PM

    A neighborhood for complex job shop scheduling problems

    • Reinhard Bürgy, presenter, GERAD, Polytechnique Montréal

    We address a job shop scheduling problem that includes a wide variety of process features and objectives which are relevant in practice. A disjunctive graph formulation is given and a feasible neighborhood is developed based on job insertion. Numerical results support the validity of our approach.

Back