Abstract
The selection of project portfolio is the main problem in project-based organizations. In project selection, optimized decision to maximizing utilization of limited resources and achieving organizational goals by considering restrictions are important. Therefore, to facilitate project portfolio selection ...
Read More
The selection of project portfolio is the main problem in project-based organizations. In project selection, optimized decision to maximizing utilization of limited resources and achieving organizational goals by considering restrictions are important. Therefore, to facilitate project portfolio selection in project-based organizations, an efficient model is proposed that is able to consider limitations, goals, and priorities of the organization in selecting the optimal combination of projects. The proposed model is a hybrid and flexible one which, including four main steps. First, with initial screening, to save time and money by using non-compensatory method, some of the poor candidate options are deleted. Then, due to multi-criteria nature of the problem, qualitative and quantitative criteria, and uncertainty of data in real world, the projects are ranked using fuzzy analytic hierarchy processes and uncertain judgments of decision-makers. To generate project baskets, integer linear programming (ILP), backpack model, is employed modifying the coefficients of the objective function of each project to preserve multi-criteria rating of projects, and then evaluate and rank the baskets. To validate the proposed model, we have carried out selection of project portfolio in the oil refining industry.
Majid Esmaelian; Sayedeh Maryam Abdollahi
Abstract
Course timetabling is an important branch of the general scheduling problem. The course timetabling problem as a step in the course planning process in universities is one of the challenges faced by managers in the field of education. The problem is defined as assigning university courses to specific ...
Read More
Course timetabling is an important branch of the general scheduling problem. The course timetabling problem as a step in the course planning process in universities is one of the challenges faced by managers in the field of education. The problem is defined as assigning university courses to specific periods throughout a week for a given semester while satisfying specific constraints. In this study, we present two novel binary integer linear programming models for the university timetabling problem. Using a GAMS IP Solver, several experiments through each model are solved and the results (the number of the decision variables and solution time) are compared and analyzed. The computational comparison indicates that the second model can be used for modeling large-scaled problems and has less computational and size complexity. Therefore, the second model is applied to optimal scheduling the courses planned for the faculty of administrative science and economics (ASE) at Isfahan University for one semester and the results consist of table of courses planned for teachers, students groups, rooms and workdays are presented
