HEURISTIC AND OPTIMUM SOLUTIONS IN ALLOCATION PROBLEMS

Iulian Mircea and Radu R. Şerban
Additional contact information
Iulian Mircea: Academy of Economic Studies, Bucharest
Radu R. Şerban: Spiru Haret University of Bucharest

Journal of Information Systems & Operations Management, 2010, vol. 4, issue 2, 126-136

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.

Keywords: Dirichlet’s problem; conex graph; maximal coupling; RCPS problem; virtual organization; allocation problem (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.rebe.rau.ro/RePEc/rau/jisomg/WI10/JISOM-WI10-A12.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:rau:jisomg:v:4:y:2010:i:2:p:126-136

Access Statistics for this article

More articles in Journal of Information Systems & Operations Management from Romanian-American University Contact information at EDIRC.
Bibliographic data for series maintained by Alex Tabusca ().