Smart logistics (schedule design, supply chains, logistics, manufacturing systems)

Back

Cahiers du GERAD

781 results — page 25 of 40

, , and

The berth allocation problem is to allocate space along the quayside to incoming ship at a container terminal in order to minimize some objective function....

BibTeX reference
and

The berth allocation problem is to allocate berths (i.e., sections of the quayside) to ships arriving in a container port in order to minimize the sum of the...

BibTeX reference
, , and

In order to achieve a successful implementation of electronic commerce (EC), it is necessary to "re-engineer" the logistics activities of the enterprise. Thi...

BibTeX reference
and

Ce document présente une revue de littérature sur la logistique inverse. Dans la littérature, plusieurs termes sont utilisés comme des synonymes, par exemple...

BibTeX reference

We propose a numerical approach to compute stationary Markov perfect Nash equilibrium advertising strategies of Lanchester model. The algorithm can be implem...

BibTeX reference
and

A sizeable proportion of manufacturing expenses can be attributed to facility layout and material handling. Facility layout decisions involve designing the ...

BibTeX reference

This paper deals with the issue of shelf-space allocation and advertising decisions in marketing channels. We consider a network composed of a unique retaile...

BibTeX reference
, , and

In the <i>m</i>-Peripatetic Salesman Problem</i> (<i>m</i>-PSP) the aim is to determine <i>m</i> edge disjoint Hamiltonian cycles of minimum total cost on a ...

BibTeX reference

This chapter describes some of the most important models and algorithms for the classical vehicle routing problem and for several families of arc routing pr...

BibTeX reference
and

Variable Neighborhood Search (VNS) is a recent metaheuristic, or framework for building heuristics, which exploits systematically the idea of neighborhood ch...

BibTeX reference
, , , and

This paper presents an exact solution approach for the problem of the simultaneous dispatching and conflict-free routing of automated guided vehicles. The ...

BibTeX reference
, , , and

We define two classes of lower bounds using either one or two simplices for the minimization of a concave function over a polytope. For each of them, a pro...

BibTeX reference
, , and

It is well known that the set of correlated equilibrium distributions of a noncooperative game is a convex polytope that includes all the Nash equilibrium ...

BibTeX reference
, , and

This paper presents a new branching strategy that is applied on the cost of a subproblem during the solution of a large-scale linear program by a column gene...

BibTeX reference
, , and

Due to the increasing popularity of automated guided vehicles in modern industry and the valuable investment they require, their design and operational issue...

BibTeX reference

This paper considers the locomotive assignment problem encountered during the planning of the operations of a freight railroad, which consists of providing s...

BibTeX reference

This paper introduces a new integrated model for the combined day-off and shift scheduling problem (the tour scheduling problem). This model generalizes the...

BibTeX reference
, , and

We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate pol...

BibTeX reference
, , and

We describe a tabu search algorithm for the vehicle routing problem with split deliveries. At each iteration, a neighbour solution is obtained by removing a ...

BibTeX reference
, , and

This paper provides a framework for logistics decision-making by classifying logistics decisions and highlighting the relevant linkages among them. We focus ...

BibTeX reference