In this paper we will describe a Multi-Agent System which iscapable of finding a feasible solution of a specially structuredlinear programming problem. Emphasis is given to correctnessissues and termination detection.

We study a class of scheduling problems involving the maximumlateness criterion and an element of batching. For all the problemsthat we examine, algorithms appear in the literature which consistof a sorting step to determine an optimal job sequence, followedby a dynamic programming step which...

One of the basic assumptions of the classical dynamic lot-sizing model is that theaggregate demand of a given period must be satisfied in that period. Under thisassumption, if backlogging is not allowed then the demand of a given period cannotbe delivered earlier or later than the period. If...

In this paper we propose a Branch and Price algorithm for solving multi-periodsingle-sourcing problems. In particular, we generalize a Branch and Price algorithm thatwas developed for the Generalized Assignment Problem (GAP) to a class of convexassignment problems. We then identify an important...

In a recent paper, Fisher et al. (2001) present a method tomitigate end-effects in lot sizing by including a valuation term for end-of-horizon inventory in the objective function of the short-horizon model. Computational tests show that the proposed method outperforms the Wagner-Whitin algorithm...

We consider a model for a serial supply chain in which production, inventory, and transportation decisions are integrated, in the presence of production capacities and for different transportation cost functions. The model we study is a generalization of the traditional single-item economic...