scispace - formally typeset
D

Diane Riopel

Researcher at École Polytechnique de Montréal

Publications -  58
Citations -  1428

Diane Riopel is an academic researcher from École Polytechnique de Montréal. The author has contributed to research in topics: Reverse logistics & Scheduling (production processes). The author has an hindex of 19, co-authored 58 publications receiving 1313 citations. Previous affiliations of Diane Riopel include École Polytechnique.

Papers
More filters
Journal ArticleDOI

A reverse logistics decisions conceptual framework

TL;DR: The proposed conceptual framework will help practitioners in the field to structure their reverse logistics activities and also help academics in developing better decision models.
BookDOI

Logistics systems : design and optimization

TL;DR: In this article, the authors present the design, planning, and optimisation of reverse logistic networks in the context of reverse Logistics Networks (RNLNs) for the transportation of high value consumer products.
Journal ArticleDOI

Integrated production and material handling scheduling using mathematical programming and constraint programming

TL;DR: In this paper, the authors proposed an integrated formulation of the combined production and material handling scheduling problems, which is formulated as a mathematical programming model and as a constraint programming model which are compared for optimally solving a series of test problems.

Integrated Production and Material Handling Scheduling Using Mathematical Programming and Constraint Programming

TL;DR: The integrated scheduling problem is formulated as a mathematical programming model and as a constraint programming model which are compared for optimally solving a series of test problems.
Journal ArticleDOI

Dispatching and Conflict-Free Routing of Automated Guided Vehicles: An Exact Approach

TL;DR: This article presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles based on a set partitioning formulation that is solved to optimality by a column generation method embedded in a branch-and-cut exploration tree.