Logistique intelligente (conception d’horaires, chaînes d’approvisionnement, logistique, systèmes manufacturiers)

Retour

Cahiers du GERAD

774 résultats — page 34 de 39

et

The multi-source Weber problem requires locating <i>m</i> new facilities in continuous space in order to minimize a sum of transportation costs to <i>n</i> ...

référence BibTeX
, et

Ce document porte sur la fonction entreposage en général et sur les méthodes de rangement en particulier. Il est divisé en deux chapitres. Dans le premier c...

référence BibTeX
, et

Nous avons procédé à des tests afin de vérifier l'applicabilité de la méthode proposée par Langevin et al (1994). Cette méthode a pour objectif la détermin...

référence BibTeX

Global optimization methods aim at finding the global optimum of a nonlinear and nonconvex function subject to nonlinear and nonconvex constraints. The main...

référence BibTeX
, , et

An overview is given, with new results, of mathematical models and algorithms for probabilistic logic, probabilistic entailment and various extensions. Anal...

référence BibTeX
, et

Examination timetabling is an important operational problem in many schools, colleges and universities. The authors have developed a computerized examinatio...

référence BibTeX
, et

Given a set of logical sentences together with probabilities that these sentences are true, the probabilistic satisfiability (PSAT) problem consists, in it...

référence BibTeX
, , , et

A count of Kekulé structures for all 1812 distinct fullerene isomers of C<sub>60</sub> shows that 20 isomers surpass the count of 12500 for icosahedral C<su...

référence BibTeX
, et

This paper presents methods to determine the optimal transfer batch sizes of various part types between two machines so as to minimize the sum of the total ...

référence BibTeX
, et

This paper presents a new approach for planning the dispatching, conflict-free routing, and scheduling of automated guided vehicles in a flexible manufactur...

référence BibTeX
et

Crew-Opt is a set-covering method that uses column-generation to produce nearly optimal solutions to crew scheduling problems. We presented this method at t...

référence BibTeX

We consider the problem of finding a shortest path for a car-like robot (approximated by a point) maneuvering around obstacles. This robot is capable of for...

référence BibTeX
, , et

This survey paper describes the significant advances made in time constrained vehicle routing and crew scheduling problems. In terms of solution methodolog...

référence BibTeX
, , , et

This paper examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set ...

référence BibTeX

This paper describes strip sequencing models for large scale traveling salesman problems arising in flexible manufacturing operations in two or three discre...

référence BibTeX
, , et

In this paper we explore a new branching strategy for branch-and-bound approaches based on column generation for the vehicle routing problems with time wind...

référence BibTeX
et

In this paper we analyze the efficiency of a given robot movement schedule for the case of a flowshop robotic production cell with <i>m</i> different machin...

référence BibTeX
, , et

It is well known that several combinatorial optimization problems can be nicely and readily modeled as an appropriate quadratic 0-1 function to be optimized...

référence BibTeX
, et

In the Dual Bin Packing Problem (DBP), there are an unlimited number of bins of identical capacity, and unsplittable items of given weights. The aim is to ...

référence BibTeX

This paper propose a column generation method for optimally solving the rostering problem. Various strategies for accelerating the column generation process...

référence BibTeX