Production yield can be highly volatile and uncertain, especially in industries where exogenous and environmental factors such as the climate or raw material...

Le Dixième atelier de résolution de problèmes industriels de Montréal, qui eut lieu du 13 au 27 août 2020, fut organisé conjointement par le Centre de recher...

This paper studies a stochastic variant of the vehicle routing problem (VRP) where both customer locations and demands are uncertain. In particular, potentia...

Binary quadratic programming (BQP) is a class of combinatorial optimization problems comprising binary variables, quadratic objective functions and linear/no...

A new linear model is presented herein to optimize strategic production scheduling of an open pit mine with multiple processing streams while accounting for...

Geostatistically simulated representations of mineral deposits are used for resource/reserve assessments, mine design and production planning, project evalua...

Industrial mining complexes can be optimized using simultaneous stochastic optimization (SSO), which manages the risks associated with meeting production tar...

This paper presents a new truck dispatching policy approach that is adaptive given different mining complex configurations in order to deliver supply materia...

The primal simplex algorithm is still one of the most used algorithms by the operations research community. It moves from basis to adjacent one until optimal...

We consider the problem of scheduling maintenance for a collection of machines under partial observations when the state of each machine deteriorates stochas...

In this paper, we introduce a new variant of the vehicle routing problem with time windows (VRPTW) that arises in parcel delivery by postal services. In addi...

Cet article présente les propriétés de l'algorithme MMCC (minimum mean cycle-canceling) pour la résolution de programmes linéaires. Initialement conçu ...

Personnel scheduling aims to determine least-cost personnel schedules to meet the demand for employees in each period of a planning horizon. In this article,...

The personalized crew rostering problem (CRP) consists of assigning pairings (sequences of flights, deadheads, connections, and rests, forming one or several...

The crew pairing problem (CPP) is solved in the first step of the crew scheduling process. It consists of creating a set of pairings (sequence of flights, co...

We consider logistic collaborations where multiple carriers collaborate by consolidating demands, combining delivery routes, and serving new customers. Logis...

Nous représentons une chaîne d'approvisionnement en boucle fermée composée d'un fabricant et d'un détaillant comme un jeu dynamique joué sur un arbre d'évén...

Given a set of predefined duties and groups of drivers, the duty assignment problem with group-based driver preferences (DAPGDP) aims at building rosters tha...

We study a new variant of the well-studied Vehicle Routing Problem with Time Windows (VRPTW), called the fragility-constrained VRPTW, which assumes that ...

Berth allocation and pilotage planning are the two most important decisions made by a seaport for serving incoming vessels. Traditionally, the berth allocati...