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

A new mixed integer programming model for curriculum balancing: Application to a Turkish university

Author

Listed:
  • Ünal, Yusuf Ziya
  • Uysal, Özgür

Abstract

Curriculum design is a highly important activity for the academic institutions. It is discussed in literature as a balancing academic curriculum problem (BACP). The BACP schedules courses to different semesters, while balancing the total workload per period. BACP model involves precedence relations, but the related courses are not necessarily assigned to closest periods.

Suggested Citation

  • Ünal, Yusuf Ziya & Uysal, Özgür, 2014. "A new mixed integer programming model for curriculum balancing: Application to a Turkish university," European Journal of Operational Research, Elsevier, vol. 238(1), pages 339-347.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:1:p:339-347
    DOI: 10.1016/j.ejor.2014.03.015
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171400229X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.03.015?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    2. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    3. Cordeau, Jean-Francois & Gaudioso, Manlio & Laporte, Gilbert & Moccia, Luigi, 2007. "The service allocation problem at the Gioia Tauro Maritime Terminal," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1167-1184, January.
    4. Mohammad Nezhad, Ali & Manzour, Hasan & Salhi, Said, 2013. "Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 713-723.
    5. Rong, Aiying & Lahdelma, Risto & Luh, Peter B., 2008. "Lagrangian relaxation based algorithm for trigeneration planning with storages," European Journal of Operational Research, Elsevier, vol. 188(1), pages 240-257, July.
    6. Mao, Kun & Pan, Quan-ke & Pang, Xinfu & Chai, Tianyou, 2014. "A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process," European Journal of Operational Research, Elsevier, vol. 236(1), pages 51-60.
    7. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    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. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    2. da Cunha, Joaquim J. & de Souza, Mauricio C., 2018. "A linearized model for academic staff assignment in a Brazilian university focusing on performance gain in quality indicators," International Journal of Production Economics, Elsevier, vol. 197(C), pages 43-51.
    3. Cristian D. Palma & Patrick Bornhardt, 2020. "Considering Section Balance in an Integer Optimization Model for the Curriculum-Based Course Timetabling Problem," Mathematics, MDPI, vol. 8(10), pages 1-12, October.

    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. David Bergman, 2019. "An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 477-492, July.
    2. Wang, Jiangjiang & Zhai, Zhiqiang (John) & Jing, Youyin & Zhang, Chunfa, 2010. "Optimization design of BCHP system to maximize to save energy and reduce environmental impact," Energy, Elsevier, vol. 35(8), pages 3388-3398.
    3. Rong, Aiying & Lahdelma, Risto, 2017. "An efficient model and algorithm for the transmission-constrained multi-site combined heat and power system," European Journal of Operational Research, Elsevier, vol. 258(3), pages 1106-1117.
    4. Jin, Jian Gang & Lee, Der-Horng & Hu, Hao, 2015. "Tactical berth and yard template design at container transshipment terminals: A column generation based approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 168-184.
    5. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    6. Correia, Isabel & Melo, Teresa & Saldanha-da-Gama, Francisco, 2012. "Comparing classical performance measures for a multi-period, two-echelon supply chain network design problem with sizing decisions," Technical Reports on Logistics of the Saarland Business School 1, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    7. Matthew E. H. Petering & Yong Wu & Wenkai Li & Mark Goh & Robert Souza & Katta G. Murty, 2017. "Real-time container storage location assignment at a seaport container transshipment terminal: dispersion levels, yard templates, and sensitivity analyses," Flexible Services and Manufacturing Journal, Springer, vol. 29(3), pages 369-402, December.
    8. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    9. Zhen, Lu & Shen, Tao & Wang, Shuaian & Yu, Shucheng, 2016. "Models on ship scheduling in transshipment hubs with considering bunker cost," International Journal of Production Economics, Elsevier, vol. 173(C), pages 111-121.
    10. Holzapfel, Andreas & Potoczki, Tobias & Kuhn, Heinrich, 2023. "Designing the breadth and depth of distribution networks in the retail trade," International Journal of Production Economics, Elsevier, vol. 257(C).
    11. Piacentino, Antonio & Barbaro, Chiara & Cardona, Fabio & Gallea, Roberto & Cardona, Ennio, 2013. "A comprehensive tool for efficient design and operation of polygeneration-based energy μgrids serving a cluster of buildings. Part I: Description of the method," Applied Energy, Elsevier, vol. 111(C), pages 1204-1221.
    12. Arturo E. Pérez Rivera & Martijn R. K. Mes, 2019. "Integrated scheduling of drayage and long-haul operations in synchromodal transport," Flexible Services and Manufacturing Journal, Springer, vol. 31(3), pages 763-806, September.
    13. Robenek, Tomáš & Umang, Nitish & Bierlaire, Michel & Ropke, Stefan, 2014. "A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports," European Journal of Operational Research, Elsevier, vol. 235(2), pages 399-411.
    14. Seok, Hyesung & Nof, Shimon Y., 2014. "Dynamic coalition reformation for adaptive demand and capacity sharing," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 136-146.
    15. Youn Ju Woo & Jang-Ho Song & Kap Hwan Kim, 2016. "Pricing storage of outbound containers in container terminals," Flexible Services and Manufacturing Journal, Springer, vol. 28(4), pages 644-668, December.
    16. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    17. Wu, Tao & Xiao, Fan & Zhang, Canrong & Zhang, Defu & Liang, Zhe, 2019. "Regression and extrapolation guided optimization for production–distribution with ship–buy–exchange options," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 15-37.
    18. García, Javier & Florez, José E. & Torralba, Álvaro & Borrajo, Daniel & López, Carlos Linares & García-Olaya, Ángel & Sáenz, Juan, 2013. "Combining linear programming and automated planning to solve intermodal transportation problems," European Journal of Operational Research, Elsevier, vol. 227(1), pages 216-226.
    19. G. Rius-Sorolla & J. Maheut & Jairo R. Coronado-Hernandez & J. P. Garcia-Sabater, 2020. "Lagrangian relaxation of the generic materials and operations planning model," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 105-123, March.
    20. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.

    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:238:y:2014:i:1:p:339-347. 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.