Heuristic And Optimum Solutions In Allocation Problems
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.
Volume (Year): 4 (2010)
Issue (Month): 2 (December)
|Contact details of provider:|| Postal: Bd.Expozitiei 1B, Bucuresti, Sector 1, Etaj 5, 012101|
Web page: http://www.rau.ro/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:rau:journl:v:4:y:2010:i:2:p:126-136. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alex Tabusca)
If references are entirely missing, you can add them using this form.