Smart logistics (schedule design, supply chains, logistics, manufacturing systems)
BackCahiers du GERAD
792 results — page 27 of 40
We consider a new variant of constrained shortest path problem, where the constraints come from a set of forbidden paths (arc sequences) that cannot be part...
BibTeX reference
The <i>Dial-a-Ride Problem</i> (DARP) consists of designing vehicle routes and schedules for <i>n</i> users who specify pick-up and drop-off requests betwee...
BibTeX reference
In the undirected <i>Hierarchical Chinese Postman Problem</i> (HCPP), the edges of a graph are partitioned into clusters and must be serviced while respecti...
BibTeX reference
The <i>Job Sequencing and Tool Switching Problem</i> (SSP) involves optimally sequencing jobs and assigning tools to a capacitated magazine in order to mini...
BibTeX referenceVariable Neighborhood Search for Extremal Graphs. 6. Analyzing Bounds for the Connectivity Index
Recently, Araujo and De la Pena (1998) gave bounds for the connectivity index of chemical trees as a function of this index for general trees and the ramifi...
BibTeX reference
The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...
BibTeX reference
We prove that amongst all fullerenes the dodecahedron has maximum smallest eigenvalue (equal to -<img src="G0234-1.gif" align=middle>), followed by the thre...
BibTeX reference
We investigate the effects of retailer's myopic behavior on channel members strategies and on sales in a single-manufacturer single-retailer distribution ne...
BibTeX reference
This article considers the (1|<i>X<sub>p</sub></i>-medianoid problem on a network <i>N</i>=(<i>V,E</i>) with vertex and edge demands. There are already <i>p...
BibTeX reference
In the <i>Maximum Cardinality Bin Packing Problem</i>, we are given <i>m</i> bins of capacity <i>c</i> and <i>n</i> items of weights <i>w<sub>i</sub></i> (...
BibTeX reference
This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first desc...
BibTeX reference
The paper considers a channel of distribution consisting of a single manufacturer and retailer. The manufacturer advertises in national media, to build up t...
BibTeX reference
The purpose of this article is to describe several applications of the Clustered Traveling Salesman Problem arising in areas as diverse as vehicle routing, ...
BibTeX referenceComputers in Graph Theory
A survey is made of computer systems which help to obtain and sometimes provide automatically proofs, conjectures and refutations in graph theory.
BibTeX reference
This paper investigates several questions related to the location of facilities in multi-storey buildings in the presence of lifts. Where should facilities ...
BibTeX reference
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. O...
BibTeX reference
This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility...
BibTeX referenceOn Uniform k-Partition Problems
We study various uniform <i>k</i>-partition problems which consist in partitioning <i>m</i> sets, each of cardinality <i>k</i>, into <i>k</i> sets of cardin...
BibTeX referenceA General Multi-Shift Scheduling System
Rotating work schedules are encountered in several industries and public sector organizations where work is carried out 24 hours a day, seven days a week. ...
BibTeX reference
We survey computers systems which help to obtain and sometimes provide automatically conjectures and refutations in algebraic graph theory.
BibTeX reference