Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
797 results — page 37 of 40
In many cities around the world, public transportation services are requested to provide adapted transportation for handicapped persons and people with rest...
BibTeX reference
We consider a generalization of PERT where task durations are variable and the cost of each task is a convex function of its duration. Moreover, each preced...
BibTeX reference
The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle routing problem where the service of a customer can begin within th...
BibTeX reference
In this paper, the problem of optimally locating the numbers around a dart board is investigated. The objective considered is risk maximization. Under diffe...
BibTeX reference
This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...
BibTeX reference
The development of truck dispatching systems has during recent years taken two directions. One has been systems using mathematical optimization and powerfu...
BibTeX reference
Because of the transmission of disease producing parasites to man and animals and the nuisance caused by bites from adult black flies, they are the object o...
BibTeX reference
This paper presents a model for the optimization of productivity in a steel plant comprised of four arc furnaces and three continuous casting machines and su...
BibTeX reference
The vehicle routing problem (VRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of vehicl...
BibTeX reference
The two-dimensional cutting-stock problem consists of laying out a specified list of rectangular pieces on rectangular sheets, in such a way as to minimize t...
BibTeX reference
The vehicle routing problem (VRP) involves the design of a set of minimum cost routes for a fleet of vehicles which services exactly once a set of customers...
BibTeX reference
Schedule compression is a major concern in project management. We propose an extension of the classical crashing model to include the managerial practice of...
BibTeX reference
This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...
BibTeX reference
We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...
BibTeX reference
The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...
BibTeX reference
In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...
BibTeX reference
Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...
BibTeX referenceMinimisation d'une fonction convexe séparable avec contraintes de rapport entre les variables
We present a dual algorithm to minimize a separable convex function under ratio constraints between variables. This minimization problem occurs when the dep...
BibTeX reference
This paper describes a family of stochastic location-routing problems which consist of simultaneously locating a depot among a set of potential sites, of det...
BibTeX reference
In this paper we analyze the problem of finding the trading area for a facility on a linear market. Given the objective of maximizing profit, we first build...
BibTeX reference