Smart logistics (schedule design, supply chains, logistics, manufacturing systems)

Back

Cahiers du GERAD

781 results — page 7 of 40

, , , and

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

BibTeX reference
, , and

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

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference
, , and

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

BibTeX reference
and

In this paper, we study the problem of responsibility sharing for product recovery, and its relation to the design of Extended Producer Responsibility (EPR) ...

BibTeX reference
, , , , and

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

BibTeX reference
, , , and

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

BibTeX reference

We address a three-level lot sizing and replenishment problem with a distribution structure (3LSPD), which is an extension of the one-warehouse multi-retaile...

BibTeX reference
, , and

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

BibTeX reference
and

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

BibTeX reference

Personnel scheduling aims at determining the cheapest work schedules to cover the demand for one or more tasks at each period of a given horizon. During the ...

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference

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

BibTeX reference
, , and

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

BibTeX reference
, , , and

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...

BibTeX reference
, , and

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

BibTeX reference
, , and

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 ...

BibTeX reference
, , , and

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

BibTeX reference