This paper considers a flexible manufacturing system for several products, each requiring a number of sequential non-preemptive tasks, some of which may be...

The development of truck dispatching systems has during recent years taken two directions. One has been systems using mathematical optimization and powerfu...

In this paper we develop a stochastic, dynamic network equilibrium model of airline passenger transportation. The model explicitly incorporates the behavior...

Because of the transmission of disease producing parasites to man and animals and the nuisance caused by bites from adult black flies, they are the object o...

CREW-OPT is a new software module in the HASTUS family of scheduling software. CREW-OPT produces optimal or near-optimal crew schedules for small problems (...

Le problème classique de dimensionnement d'un réseau de télécommunications se formule en général comme suit: étant donné un réseau, une matrice de trafic et...

The problem we consider is that of preparing a minimum cost transportation plan by simultaneously solving the following two sub-problems: first the assignm...

This paper presents a model for the optimization of productivity in a steel plant comprised of four arc furnaces and three continuous casting machines and su...

The vehicle routing problem (VRP) involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a fleet of vehicl...

The two-dimensional cutting-stock problem consists of laying out a specified list of rectangular pieces on rectangular sheets, in such a way as to minimize t...

The vehicle routing problem (VRP) involves the design of a set of minimum cost routes for a fleet of vehicles which services exactly once a set of customers...

Schedule compression is a major concern in project management. We propose an extension of the classical crashing model to include the managerial practice of...

This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and exten...

We consider projects represented by a PERT network, with convex cost-of-time functions on individual activities, and we show the existence of an efficient m...

The multiple vehicle many-to-many routing problem is presented in the context of a dial-a-ride system. It is solved by mini-clustering first and optimal ro...

We present an algorithm that solves the problem of finding the vehicle schedule which minimizes total inconveniences for travel along a fixed path, where se...

Le problème classique d'optimisation de la capacité des réseaux de télécommunications s'énonce comme suit: pour un réseau dont la structure, la demande et l...

Several single-commodity, two-commodity and multi-commodity flow formulations have recently been introduced for the travelling salesman problem. The purpose...

In this paper, we present general formulations for the stochastic vehicle routing problem with capacity restrictions in which the <i>m</i> vehicle tours hav...

Given a weighted graph with profits associated with the vertices, the selective travelling salesman problem (or orienteering problem) consists of selecting ...