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: |
Web page: http://www.rau.ro/Email:
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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.