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

Back

Cahiers du GERAD

774 results — page 14 of 39

, , , and

In this paper a new branch-price-and-cut method for a maritime inventory routing problem for one of the world's largest producers of liquefied natural gas (L...

BibTeX reference

The inventory routing problem (IRP) and the production routing problem (PRP) are two difficult problems arising in the planning of integrated supply chains...

BibTeX reference
and

The problem of coordinating a fleet of vehicles so that all demand points on a territory are serviced and that the workload is most evenly distributed among ...

BibTeX reference
, , and

A game theoretical model featuring a manufacturer and two dealers is proposed to investigate the effects of downstream horizontal integration on network perf...

BibTeX reference
and

We consider a Closed-loop supply chain (CLSC) with a single manufacturer and a single retailer. We characterize and compare the feedback equilibrium resul...

BibTeX reference
, , and

A significant game-theoretic literature on the coordination of distribution channels has developed over the past three decades. We provide an extensive analy...

BibTeX reference
, , and

In an onshore oil field, the productivity of oil wells decreases when they require maintenance. To restore full productivity at a well, it must be visi...

BibTeX reference
and

We introduce a signless Laplacian for the distance matrix of a connected graph, called the <i>distance signless Laplacian</i>. We study the <i>distance signl...

BibTeX reference
and

We introduce a Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and we study its spectrum. We show the equivalenc...

BibTeX reference
and

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the or...

BibTeX reference

The Job Grouping Problem consists of assigning a set of jobs, each with a specific set of tool requirements, to machines with a limited tool capacity in orde...

BibTeX reference
, , and

Column generation for solving linear programs with a huge number of variables alternately solves a (restricted) master problem and a pricing subproblem to ad...

BibTeX reference
, , , , , and

The min-max <i>k</i>-vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle in order to find a set of b...

BibTeX reference
, , and

Modularity maximization is extensively used to detect communities in complex networks. It has been shown however that this method suffers from a resolution l...

BibTeX reference
, , and

We study the problem of packing equal circles in a square from the mathematical programming point of view. We discuss different formulations, we analyse fo...

BibTeX reference
and

In a recent paper, Zhan, Zhang, Guan, and Zhou [Phys. Rev. E <b>83</b>, 066120 (2011)] presented a modified adaptive genetic algorithm (MAGA) tailored to the...

BibTeX reference
, , , , and

We present a branch-price-and-cut method to solve a maritime pickup and delivery problem with time windows and split loads. The fleet of ships is heterogen...

BibTeX reference
and

In chemical graph theory, many graph parameters, or topological indices, were proposed as estimators of molecular structural properties. Often several varian...

BibTeX reference

Operational problems arising in the planning of integrated supply chains have been increasingly studied in the past decade. Among these, the production rout...

BibTeX reference
, , , and

It is well known that some local search algorithms for <i>K</i>-clustering problems could stop at a solution with fewer clusters than the desired <i>K</i>....

BibTeX reference