IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v157y2004i2p398-408.html
   My bibliography  Save this article

The analytic hierarchy process and multiobjective 0-1 faculty course assignment

Author

Listed:
  • Ozdemir, Mujgan S.
  • Gasimov, Rafail N.

Abstract

No abstract is available for this item.

Suggested Citation

  • Ozdemir, Mujgan S. & Gasimov, Rafail N., 2004. "The analytic hierarchy process and multiobjective 0-1 faculty course assignment," European Journal of Operational Research, Elsevier, vol. 157(2), pages 398-408, September.
    • Handle: RePEc:eee:ejores:v:157:y:2004:i:2:p:398-408
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00189-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hertz, A., 1991. "Tabu search for large scale timetabling problems," European Journal of Operational Research, Elsevier, vol. 54(1), pages 39-47, September.
    2. Badri, Masood A., 1996. "A two-stage multiobjective scheduling model for [faculty-course-time] assignments," European Journal of Operational Research, Elsevier, vol. 94(1), pages 16-28, October.
    3. Costa, Daniel, 1994. "A tabu search algorithm for computing an operational timetable," European Journal of Operational Research, Elsevier, vol. 76(1), pages 98-110, July.
    4. G. Y. Chen & W. D. Rong, 1998. "Characterizations of the Benson Proper Efficiency for Nonconvex Vector Optimization," Journal of Optimization Theory and Applications, Springer, vol. 98(2), pages 365-384, August.
    5. Z. F. Li, 1998. "Benson Proper Efficiency in the Vector Optimization of Set-Valued Maps," Journal of Optimization Theory and Applications, Springer, vol. 98(3), pages 623-649, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Geiger, Martin Josef & Wenger, Wolf, 2010. "On the assignment of students to topics: A Variable Neighborhood Search approach," Socio-Economic Planning Sciences, Elsevier, vol. 44(1), pages 25-34, March.
    2. Nergiz Kasimbeyli, 2015. "Existence and characterization theorems in nonconvex vector optimization," Journal of Global Optimization, Springer, vol. 62(1), pages 155-165, May.
    3. Dönmez, Kadir & Demirel, Soner & Özdemir, Mustafa, 2020. "Handling the pseudo pilot assignment problem in air traffic control training by using NASA TLX," Journal of Air Transport Management, Elsevier, vol. 89(C).
    4. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    5. Ho, William, 2008. "Integrated analytic hierarchy process and its applications - A literature review," European Journal of Operational Research, Elsevier, vol. 186(1), pages 211-228, April.
    6. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    7. Gartner, Daniel & Kolisch, Rainer, 2021. "Mathematical programming for nominating exchange students for international universities: The impact of stakeholders’ objectives and fairness constraints on allocations," Socio-Economic Planning Sciences, Elsevier, vol. 76(C).
    8. Gasimov, Rafail N. & Sipahioglu, Aydin & Sarac, Tugba, 2007. "A multi-objective programming approach to 1.5-dimensional assortment problem," European Journal of Operational Research, Elsevier, vol. 179(1), pages 64-79, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vermuyten, Hendrik & Lemmens, Stef & Marques, Inês & Beliën, Jeroen, 2016. "Developing compact course timetables with optimized student flows," European Journal of Operational Research, Elsevier, vol. 251(2), pages 651-661.
    2. De Causmaecker, Patrick & Demeester, Peter & Vanden Berghe, Greet, 2009. "A decomposed metaheuristic approach for a real-world university timetabling problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 307-318, May.
    3. Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
    4. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    5. White, George M. & Xie, Bill S. & Zonjic, Stevan, 2004. "Using tabu search with longer-term memory and relaxation to create examination timetables," European Journal of Operational Research, Elsevier, vol. 153(1), pages 80-91, February.
    6. Salem Al-Yakoob & Hanif Sherali, 2015. "A column generation mathematical programming approach for a class-faculty assignment problem with preferences," Computational Management Science, Springer, vol. 12(2), pages 297-318, April.
    7. D. S. Kim & G. M. Lee & P. H. Sach, 2004. "Hartley Proper Efficiency in Multifunction Optimization," Journal of Optimization Theory and Applications, Springer, vol. 120(1), pages 129-145, January.
    8. P. H. Sach, 2007. "Moreau–Rockafellar Theorems for Nonconvex Set-Valued Maps," Journal of Optimization Theory and Applications, Springer, vol. 133(2), pages 213-227, May.
    9. Haroldo Santos & Eduardo Uchoa & Luiz Ochi & Nelson Maculan, 2012. "Strong bounds with cut and column generation for class-teacher timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 399-412, April.
    10. Timothy R. Hinkin & Gary M. Thompson, 2002. "SchedulExpert: Scheduling Courses in the Cornell University School of Hotel Administration," Interfaces, INFORMS, vol. 32(6), pages 45-57, December.
    11. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    12. P. H. Sach, 2003. "Nearly Subconvexlike Set-Valued Maps and Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 119(2), pages 335-356, November.
    13. Boronico, Jess, 2000. "Quantitative modeling and technology driven departmental course scheduling," Omega, Elsevier, vol. 28(3), pages 327-346, June.
    14. Johnes, Jill, 2015. "Operational Research in education," European Journal of Operational Research, Elsevier, vol. 243(3), pages 683-696.
    15. de Werra, D., 1997. "The combinatorics of timetabling," European Journal of Operational Research, Elsevier, vol. 96(3), pages 504-513, February.
    16. Hertz, Alain & Robert, Vincent, 1998. "Constructing a course schedule by solving a series of assignment type problems," European Journal of Operational Research, Elsevier, vol. 108(3), pages 585-603, August.
    17. Nonobe, Koji & Ibaraki, Toshihide, 1998. "A tabu search approach to the constraint satisfaction problem as a general problem solver," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 599-623, April.
    18. Schirmer, Andreas & Potzhar, Kathrin, 2001. "Professional course scheduling in airline transport pilot training: A case from Lufthansa flight training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 539, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Daniel Berend & Ephraim Korach & Shira Zucker, 2012. "Tabu search for the BWC problem," Journal of Global Optimization, Springer, vol. 54(4), pages 649-667, December.
    20. S K Mirrazavi & S J Mardle & M Tamiz, 2003. "A two-phase multiple objective approach to university timetabling utilising optimisation and evolutionary solution methodologies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1155-1166, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:157:y:2004:i:2:p:398-408. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.