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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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