Abstract
Assignments of lecturers to courses is one of the problems in education management (or planning) especially in higher institutions such as universities or colleges. This paper investigates the feasibility of determining an optimal assignment of lecturers to courses under various conditions using an operations research method. Beginning with the classic general almost ``free entry or ``unrestricted pure transportation model of linear programming, the problem is extended to include possibilities such as course-sharing and time-tabling clashing. This leads to the formulation of a revised zero-one integer programming model. The results of some empirical tests are also reported. Keywords: Assignment; zero-one integer programming
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
