Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
792 results — page 25 of 40
Design of Balanced MBA Student Teams
In some schools and universities, students must sometimes be divided into several teams in such a way that each team provides a good representation of the cl...
BibTeX referenceSelected Topics in Column Generation
Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a success story in large scale integer programming. We outline and relate ...
BibTeX reference
We propose a differential game to study retailer’s allocation strategy of shelf-space shares between the manufacturers of two competing brands. Each manufact...
BibTeX reference
A constant fixed cost of establishing a facility is introduced within the framework of minisum facility location in the continuous space. The solution metho...
BibTeX reference
In this exploratory study, a segmentation analysis of a shopping mall’s customers is conducted according to the activities they performed during their visit,...
BibTeX reference
A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in the continuous space. An efficient algorithm for determin...
BibTeX referenceAltitude Manpower Planning. An Integrated System that Addresses the Puzzle of Planning a Crew Force
A critical aspect of operating an airline is to continuously maintain adequate staffing levels of qualified crewmembers. The airline must be able to plan sev...
BibTeX reference
The integrated aircraft routing and crew scheduling problem consists in determining a minimum-cost set of aircraft routes and crew pairings such that each fl...
BibTeX reference
Column generation is often used to solve problems involving set partitioning constraints, such as vehicle routing and crew scheduling problems. When these co...
BibTeX reference
This paper examines the convergence properties of two well-known heuristics: variable neighborhood search (VNS) and random multistart local search (MLS). Bot...
BibTeX reference
When applying the 2-opt heuristic to the travelling salesman problem, selecting the best improvement at each iteration gives worse results on average than se...
BibTeX reference
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
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
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
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
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
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