Assigning students to academic majors
We address here the problem of assigning undergraduate students to academic major areas at a Middle-Eastern business school, which is quite different from what one usually faces in the West. Our formulation considers the student's preference in the light of his/her performance in certain bellwether courses and various practical constraints in arriving at an initial solution. We present a linear program that maximizes the overall value of the assignments to the students as well as the academic units concerned. We show through a real example how this approach has been implemented as one step in the major-assignment process.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 29 (2001)
Issue (Month): 6 (December)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Mustafa, A. & Goh, M., 1996. "Multi-criterion models for higher education administration," Omega, Elsevier, vol. 24(2), pages 167-178, April.
- Mingers, J. & O'Brien, F. A., 1995. "Creating student groups with similar characteristics: A heuristic approach," Omega, Elsevier, vol. 23(3), pages 313-321, June.
- Weitz, R. R. & Lakshminarayanan, S., 1997. "An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling," Omega, Elsevier, vol. 25(4), pages 473-482, August.
- Bhadury, Joyendu & Mighty, E. Joy & Damar, Hario, 2000. "Maximizing workforce diversity in project teams: a network flow approach," Omega, Elsevier, vol. 28(2), pages 143-153, April.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:29:y:2001:i:6:p:513-523. 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: (Shamier, Wendy)
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.