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

Back

Cahiers du GERAD

797 results — page 36 of 40

, , , and

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

BibTeX reference
, , and

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

BibTeX reference

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

BibTeX reference

The purpose of this paper is to formulate and solve an optimization problem arising in the operations of a numerical control machine such as a punch press. ...

BibTeX reference
, , and

In operations planning in an open pit mine an economic blocks model is generally used which attempts to determine which blocks will be extracted during each...

BibTeX reference
, , and

Given a binary matrix <i>E</i>, the Seriation Problem consists of determining a permutation of the rows of <i>E</i> minimizing the sum over all columns of t...

BibTeX reference
, , and

The majority of the examination timetabling software programs available today suffer from one of the following drawbacks: either the techniques are not very...

BibTeX reference

We consider the problem of finding a shortest path for a car-like robot maneuvering in a convex cell. This robot, capable of forward and backward motion, is...

BibTeX reference

We study the problem of finding a shortest path for a car-like mobile robot with a minimal turning radius constraint. This vehicle can move either forward o...

BibTeX reference
, , , and

This paper presents the development of a new optimal dynamic programming algorithm for the minimization of the total traveling cost for the traveling salesm...

BibTeX reference
, , and

The NP-hard problem addressed in this paper is well known in the scheduling literature as <i>R</i>|<i>C</i><sub><font size=-1>max</font></sub>. We introduce...

BibTeX reference

The problem of finding a minimal length trajectory (MLT) for a mobile robot has changed in the last five years, as vehicle kinematics have come to be taken ...

BibTeX reference

In this paper, optimal strip strategies are developed for a variety of two-dimensional and three-dimensional sequencing problems arising in flexible manufac...

BibTeX reference
, , , , and

We present a new two-commodity flow formulation for the traveling salesman problem. Each commodity corresponds to a resource that is either distributed or p...

BibTeX reference

In this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under thr...

BibTeX reference
, , and

Examination scheduling is a problem in virtually every high school, college and university. The basic challenge is to schedule examinations over a limited ...

BibTeX reference
, , and

The purpose of this paper is to describe a new tabu search heuristic for the vehicle routing problem with capacity and route length restrictions. The algori...

BibTeX reference
, , , , , and

The Airline Crew Scheduling Problem can be defined as the problem of finding a set of feasible rotations so that the total cost is minimum and all the fligh...

BibTeX reference
and

This paper describes a domain criterion for a multicriteria problem, given a single decision maker. It then outlines possibilities for aggregating individua...

BibTeX reference

We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process ...

BibTeX reference