The problem of flow management for a class of flexible manufacturing cells is considered. The cell is designed for cyclic production of one product. This product is characterized by a sequence of operations of given length and each requiring a set of resources; the problem is therefore to...

We consider the NP-hard Multiple Depot Vehicle Scheduling Problem, in which a given set of time-tabled trips have to be assigned to vehicles stationed at different depots, so as to minimize the number of vehicles used and the overall operational cost. The problem arises in the management of...

Suggests that, in recent years, remarkable progress has been made in the development of the topological design of logistics networks, especially in the warehouse location problem. Extends the standard warehouse location problem to a generalization of multiproduct capacitated warehouse location...

In this paper we consider a type of bias which stems from the mathematical algorithm often used to determine an optimal match between two groups. We compare two different solution concepts for the matching assignment problem: the traditionally stable solution vs. a multiplicative utility...

This paper first examines the role of ceiling points in solving a pure, general integer linear programming problem (P). Several kinds of ceiling points are defined and analyzed and one kind called "feasible 1-ceiling points" proves to be of special interest. We demonstrate that all optimal...

We consider two classes of multi-item lot-sizing problems. The first is a class of single stage problems involving joint machine capacity constraints and/or start up costs, and the second is a class of multistage problems with general product structure. The problems are solved as mixed integer...

The problem of cyclic scheduling of two hoists is defined as follows. There are N + 1 workstations, S₀, S₁, ..., S_N, and two identical hoists that move jobs between stations. Jobs are identical and each job has to visit all stations in the order that stations are numbered. It is assumed that the...

Describes how an LP‐based one‐dimensional packing algorithm can be used to minimise costs in three different multiple‐vehicle shipment planning problems. The three applications considered are: (1) shipping industrial trucks by container when weight is the dominant constraint; (2) shipping...