• Tidak ada hasil yang ditemukan

Goal programming approach for course-timeslot timetabling problem

N/A
N/A
Protected

Academic year: 2024

Membagikan "Goal programming approach for course-timeslot timetabling problem"

Copied!
1
0
0

Teks penuh

(1)

Goal programming approach for course-timeslot timetabling problem ABSTRACT

The aim of this study is to develop a goal programming model for course-timeslot timetabling problem. Constructing a timetable is considered as a difficult task. This is because it considers multiple decisions and objectives such as the institution’s availability, objectives, timeslots, and capacity of classrooms. Therefore. this study will develop a course-timeslot timetable in Faculty Science and Natural resources (FSSA), Universiti Malaysia Sabah. The models seek to assign courses with allocated timeslots. In addition, with the aim of finding the optimization solution, the models are solved by using a software, called LINGO. The results shows that the model has the capability to solve the coursetimeslot timetabling problem by satisfying all the constraints with regard to the courses offering and timeslots availability so that every course can be assigned to the most suitable timeslots.

Referensi

Dokumen terkait

• The second model let us determine some best compromise or satisfying harvest schedules when the following criteria are considered: habitat diversity, financial returns,

Objective functions will be used to measure how well the ,ft constraints are satisfied. This is important to determine the >lution quality of the exam

In this paper we proposed a multi objective linear programming approach to solve a Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). Two goals are to

edu.my ABSTRACT In order to develop approaches to solve a fuzzy linear programming problem, it is necessary to study first the formulation of membership functions and then the

Genetic Algorithm GA emerge as one automation timetabling method to solve timetabling problem by searching solution in multi-points and the ability to refine the existing solution to

1.4 Scope This study emphasizes the use of Weighted Goal Programming WGP model as well as the Linear Programming LP model to examine budgetary manufacturing process and improve the

Genetic Algorithms With Guided and Local Search Strategies for University Course Timetabling Shengxiang Yang, Member, IEEE, and Sadaf Naseem Jat Abstract—The university course

In contrast to the original SS, SSV1 and SSV2 use the quality and diversity of solutions to create and update the memory, to perform solutions combinations, and to update the search..