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

Retour

Cahiers du GERAD

781 résultats — page 7 de 40

, , et

We consider a personalized employee scheduling problem with characteristics present in retail stores consisting of multiple departments. In the setting under...

référence BibTeX
, et

This paper develops an exact method for the redundancy allocation problem (RAP) for multistate homogeneous series-parallel systems. The problem aims to min...

référence BibTeX

The Integral Simplex Using Decomposition (ISUD) algorithm has been developed recently to solve large set partitioning problems (SPPs) in a primal way, i.e.,...

référence BibTeX
, et

Facility networks can be disrupted by, for example, power outages, poor weather conditions, or natural disasters, and the probabilities of these events may b...

référence BibTeX
, et

In this paper, we develop algorithmic approaches for a recently defined class of games, the integer programming games. Two general methods to approximate an...

référence BibTeX
et

Dans cet article, nous étudions le problème du partage de responsabilités dans la récupération de produits usés et son lien avec la conception d’une réglemen...

référence BibTeX
, , , et

We study an integrated process configuration, lot-sizing, and scheduling problem, which appears in a real production environment in the packaging industry. P...

référence BibTeX

This paper addresses combinatorial optimization problems under uncertain and correlated data where the mean-covariance information of the random data is assu...

référence BibTeX

Nous étudions un problème intégré de planification de production et de transport sur trois niveaux avec une structure de distribution (3LSPD), problème qui e...

référence BibTeX
, et

We consider an integrated planning problem that combines production, inventory and inbound transportation decisions in a context where several suppliers each...

référence BibTeX
et

The Time Window Assignment Vehicle Routing Problem (TWAVRP) is the problem of assigning time windows for delivery before demand volume becomes known. This i...

référence BibTeX

Les problèmes de gestion de personnel visent à déterminer les horaires de travail les moins coûteux pour couvrir la demande d'une ou plusieurs tâches à chaqu...

référence BibTeX

In this paper, we address a personalized multi-department multi-day shift scheduling problem with a multi-skill heterogeneous workforce where employees can b...

référence BibTeX
, et

Vehicle routing problems (VRPs) are among the most studied problems in operations research. Nowadays, the leading exact algorithms for solving many classes o...

référence BibTeX

Clustering is the subject of active research in several fields such as operations research, statistics, pattern recognition, and machine learning. The range ...

référence BibTeX
, et

This paper focuses on the traveling salesman problem with time windows (TSPTW) that arises in postal services and parcel deliveries and has features differin...

référence BibTeX
, , et

Clustering is an automated and powerful technique for data analysis. It aims to divide a given set of data points into clusters which are homogeneous and/o...

référence BibTeX
, et

This paper introduces two classes of location problems with interconnected facilities. These problems differ from classical location problems in the sense ...

référence BibTeX
, et

Employee scheduling is an important activity in the service industry as it has a significant impact on costs, sales, and profitability. While a large amount ...

référence BibTeX
, , et

This paper addresses the winner determination problem (WDP) for TL transportation procurement auctions under uncertain shipment volumes and uncertain carrier...

référence BibTeX