HEURISTIC AND OPTIMUM SOLUTIONS IN ALLOCATION PROBLEMS

Abstract

In this paper we present some models and algoritms for solving some typical production planning and scheduling problems. We present the Resource-Constrained Project Scheduling Problem (RCPSP) and algorithms for the determination of maximal couplings with minimal arch length in the graph attached to an allocation problem, and for the determination of the solution of Dirichlet problem and of the potential-voltage problem which appear in a production planning. We develop a model for allocating work among potential VO partners, taking into account fixed and variable work costs and transportation costs.Dirichlet’s problem, conex graph, maximal coupling, RCPS problem, virtual organization, allocation problem