In this paper, we aim to measure agricultural productivity change of 34 OECD countries between years 1990 and 2014. The methods employed are data envelopment analysis (DEA) and malmquist productivity index (MPI). DEA is a relative efficiency method in a production technology, whereas MPI is based on DEA to measure the changes in the production technology over time. Our challenge is the existence of missing data points over the years in the initial dataset, which correspond to approximately 9% of the data. Removing units, factors or years with missing data as commonly practiced in DEA, would cause loss of information and makes it very difficult to draw conclusions in such a macro-data. We present the idea of using averages of available data points for a given factor and average variations over the years in those data to produce intervals for the missing points and handle the problem without any dimension reduction in the available data. Fuzzy DEA approach is employed using the calculated factor-specific intervals followed by MPI calculations to conduct a productivity change analysis. We suggest and empirically illustrate that instead of narrowing down the scope of the analysis by excluding the points missing, applying fuzzy approaches is an option worth considering by which it can be possible to make the best out of the available information. The results of the analysis are interpreted with respect to years, countries, regions and economic size of the countries.

Abstract: Aim: This study is on tackling Examination Timetabling Problem (ETP) of the Faculty of Economics And Administrative Sciences (FEAS) of the Ankara HBV University summer school, where the courses of fall and spring semesters are offered simultaneously and regulations on restricting enrollments in inter-department electives or in-department courses of distinct years are relaxed. Thus, the complexity of the nature of the ETP problem is exacerbated. The direct heuristics based on successive assignments that the university normally adopts was proven inadequate for assuming standard regulations hence, another approach we explain in this paper was needed. Design / Research methods: The ETP was formulated as a Linear Mixed-Integer Program (LMIP) and decomposed into three stages; timetabling exams, room assignment, student allocation. To manage the conflict between the stakeholders of the examination procedure, a lexicographic optimization process based on the priority of the parties was undertaken. Conclusions / findings: After a recursive timetabling process based on a trial-and-error method a clash-free timetable was generated and, a room assignment plan that minimizes the total number of proctoring duties, usage of higher floor rooms and total crowdedness of rooms respectively was put into action. Therefore no student group experienced any clashing exams, the faculty members saved time that can be spent on research instead, since the room usage was better planned the costs (elevator usage, lighting, air conditioning, the labor of the janitors) were assumed to be decreased. Originality / value of the article: Each examination period bares a different ETP due to its problem-specific nature (number of courses offered, structure of student enrollments, availability of rooms, etc.). Summer schools provide a more irregular structure that demands special attention, a trial-and-error reformulation of the ETP in our case. In addition, the traditional formulations of the ETP, to the extent we have been able to scan, do not include the minimization of the crowdedness of the rooms. Thus, in creating a more comfortable environment, easier to monitor exams and, ability in handling unexpected dysfunctionalities (broken classroom equipment, etc.) this study is novel. Limitations of the research: The algorithms to solve an ETP formulated as an LMIP are of high complexity therefore, we are not able to assert the optimality of our suggested solutions acquired within time limitations. Keywords: examination timetabling, group decision making, lexicographic optimization, linear mixed-integer programming JEL: C44, C61, M12