Weighted Assignment Models and Their Application
AbstractThis paper defines the components and characteristics of an important class of models called weighted assignment models and identifies these elements in a number of existing and potential applications. The weighted assignment model represents problems with the following characteristics: A set of tasks must be divided among a set of agents, and each task must be completed by only one agent. Tasks may be completed at one of several predetermined levels. When an agent completes a task at some level, a resource possessed by the agent is consumed and a system disutility is incurred. The weighted assignment model may be used to determine the best assignment of tasks to agents and the task completion levels so as to minimize total system disutility while satisfying the agent resource constraints. In the first part of the paper, a general formulation is presented, and its relationship to assignment models, transportation models, knapsack models and various fixed charge models is established. In the second part of the paper, a number of applications are described which demonstrate the usefulness of weighted assignment models. These applications include machine loading problems, personnel assignment problems and districting problems. Computational results for several of the applications are presented to document the tractability of the models.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 25 (1979)
Issue (Month): 7 (July)
networks/graphs: applications; programming: integer; applications; programming: integer algorithms;
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Mirko Janc).
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.