To see the other types of publications on this topic, follow the link: Timetable allocation.
Journal articles on the topic 'Timetable allocation'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 26 journal articles for your research on the topic 'Timetable allocation.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
Palmqvist, Carl-William, Nils O. E. Olsson, and Lena Winslott Hiselius. "The Planners’ Perspective on Train Timetable Errors in Sweden." Journal of Advanced Transportation 2018 (2018): 1–17. http://dx.doi.org/10.1155/2018/8502819.
Full textAbstract:
Timetables are important for train punctuality. However, relatively little attention has been paid to the people who plan the timetables: the research has instead been more centred on how to improve timetables through simulation, optimisation, and data analysis techniques. In this study, we present an overview of the state of practice and the state of the art in timetable planning by studying the research literature and railway management documents from several European countries. We have also conducted interviews with timetable planners in Southern Sweden, focusing on how timetable planning relates to punctuality problems. An important backdrop for this is a large project currently underway at the Swedish Transport Administration, modernizing the timetable planning tools and processes. This study is intended to help establish a baseline for the future evaluation of this modernization by documenting the current process and issues, as well as some of the research that has influenced the development and specifications of the new tools and processes. Based on the interviews, we found that errors in timetables commonly lead to infeasible timetables, which necessitate intervention by traffic control, and to delays occurring, increasing, and spreading. We found that the timetable planners struggle to create a timetable and that they have neither the time nor the tools required to ensure that the timetable maintains a high quality and level of robustness. The errors we identified are (a) crossing train paths at stations, (b) wrong track allocation of trains at stations, especially for long trains, (c) insufficient dwell and meet times at stations, and (d) insufficient headways leading to delays spreading. We have identified eleven reasons for these errors and found three themes among these reasons: (1) “missing tools and support,” (2) “role conflict,” and (3) “single-loop learning.” As the new tools and processes are rolled out, the situation is expected to improve with regard to the first of these themes. The second theme of role conflict occurs when planners must strive to meet the demands of the train operating companies, while they must also be unbiased and create a timetable that has a high overall quality. While this role conflict will remain in the future, the new tools can perhaps help address the third theme by elevating the planners from first- to double-loop learning and thereby allowing them to focus on quality control and on finding better rules and heuristics. Over time, this will lead to improved timetable robustness and train punctuality.
2
Široký, Jaromír, Petr Nachtigall, Jozef Gašparík, and Jiří Čáp. "Calculation Model of Railway Capacity Price in the Czech Republic." Promet - Traffic&Transportation 33, no. 1 (January 31, 2021): 91–102. http://dx.doi.org/10.7307/ptt.v33i1.3544.
Full textAbstract:
This paper presents a pricing model of railway infrastructure capacity allocation functioning as a regulatory measure while fulfilling the regulatory requirements on railway infrastructure capacity allocation. The prices of railway infrastructure capacity allocation will be modelled with regard to all economically justifiable costs of railway infrastructure capacity allocation. The structure of model has been developed as a set of calculation sheets in Microsoft Excel. The recommended prices for railway capacity have been found by simulation of a set of variants and the recommendation is done for different operational conditions in an individual way. It analyses different products offered by the railway infrastructure capacity allocator both in the annual working timetable mode, and in the individual ad hoc mode. The aim of the proposed model is to motivate not only railway undertakings, but also the railway infrastructure capacity allocator to submit requests for railway infrastructure capacity in the annual working timetable mode rather than in the individual ad hoc mode. The total price is then verified to the cost of railway infrastructure capacity allocation. This process then ensures the regulation of the demand of railway undertakings on the given route and can influence the decision about the use of the product offered.
3
Alghamdi, H., T. Alsubait, H. Alhakami, and A. Baz. "A Review of Optimization Algorithms for University Timetable Scheduling." Engineering, Technology & Applied Science Research 10, no. 6 (December 20, 2020): 6410–17. http://dx.doi.org/10.48084/etasr.3832.
Full textAbstract:
The university course timetabling problem looks for the best schedule, to satisfy given criteria as a set of given resources, which may contain lecturers, groups of students, classrooms, or laboratories. Developing a timetable is a fundamental requirement for the healthy functioning of all educational and administrative parts of an academic institution. However, factors such as the availability of hours, the number of subjects, and the allocation of teachers make the timetable problem very complex. This study intends to review several optimization algorithms that could be applied as possible solutions for the university student course timetable problem. The reviewed algorithms take into account the demands of institutional constraints for course timetable management.
4
Meng, Lingyun, Malik Muneeb Abid, Xinguo Jiang, Afaq Khattak, and Muhammad Babar Khan. "Increasing Robustness by Reallocating the Margins in the Timetable." Journal of Advanced Transportation 2019 (July 28, 2019): 1–15. http://dx.doi.org/10.1155/2019/1382394.
Full textAbstract:
It is a common practice to improve the punctuality of a railway service by the addition of time margins during the planning process of a timetable. Due to the capacity constraints of the railway network, a limited amount of time margins can be inserted. The paper presents a model and heuristic technique to find the better position for the limited amount of time margins (headway buffers and running time supplements) in a train timetable. The aim of reallocating the time margins is to adjust an existing timetable to minimize the sum of train delays at the event of the operational disturbances. The model consists of two basic parts. Firstly, the paper treats the train timetable as a Directed Arc Graph (DAG) with the aggregation concept and proposes a heuristic technique known as Critical Time Margins Allocation (CTMA), which is based on the critical path method (CPM), to reallocate the time margins. Secondly, the paper evaluates the original and modified timetable under different disturbed situations. The case study is developed on a hypothetical small railway network and a practical timetable of single-line train timetable for the track segment of Rawalpindi to Lalamusa, Pakistan. The results show that the timetable modified with the CTMA reduces the total delay time by an average of 3.25% for the small railway network and 5.18% for the large dataset. It suggests that adding the time supplements to the proper positions in a timetable can reduce the delay propagation and increase the robustness of the timetable.
5
Dr. V.Vinodhini, A.Subashini, and S.Sathesh Kumar. "Auto-Time Table Automation Tool using Genetic Algorithm." International Journal of Engineering and Management Research 11, no. 2 (April 30, 2021): 122–25. http://dx.doi.org/10.31033/ijemr.11.2.18.
Full textAbstract:
Time Table Computerization Tool is utilized for all educational pitch. The process includes two client features, the institution head and staff individuals. Institution head has all the rights to control and change the given information. All office accessible in the institution will be kept up through division's module. Administrator can pick any staff individual from the necessary office and can allocateto a prescribed class. During allocation the procedure followed with respective subjects in the institution for first, second, third, final year and so. Staff must be browsed with the necessary division. Administrator picks relating staff for their respective subjects and ration them. After staff dispersal, their time table will be shaped by the administrator which can be perceived by the staff individuals. Staff will have separate login framework, where they can login and can perceive their time tables. For other years same criteria will be followed in order to distribute the subjects among staff evenly. The Auto timetable schedule feature automates class, exam, and course forecast process for students, teachers, and different classrooms by taking into consideration all the possible. Furthermore, the timetable software integrates user-centric and simple-to-use tools to for educators to view, organize, and generate master and individual timetables for each teacher/ class/grade, develop personalized timetables, create and pin to-do lists, schedule substitute replacements for absent staff, manage and organize events on calendar, and much more on smartphone, tablet and computer devices.
6
El-Dhshan, Abdalla, Hegazy Zaher, and Naglaa Ragaa. "An Intelligent Technique for Solving Timetable Problem." Journal of University of Shanghai for Science and Technology 23, no. 05 (May 7, 2021): 1–11. http://dx.doi.org/10.51201/jusst/21/04251.
Full textAbstract:
Timetabling problem is complex combinatorial resources allocation problems. There are two hard and soft constraints to be satisfied. The timetable is feasible if all hard constraints are satisfied. Besides, satisfying more of the soft constraints produces a high-quality timetable. Crow Search Algorithm (CSA) as an intelligence technique presents for solving timetable problem. CSA like all meta-heuristic optimization techniques is a nature-inspire of intelligent behavior of crows. The proposed CSA tested using the well-known benchmark of hard timetabling datasets (hdtt). Taguchi’s method used to tune the best parameter combinations for the factors and levels. The tuned parameters of CSA are applied on datasets in separate experiment. The results show that the proposed CSA is superior to generate solutions in reasonable CPU time when compared with other literature techniques.
7
Zhang, Qin, Xiaoning Zhu, Li Wang, and Shuai Wang. "Simultaneous Optimization of Train Timetabling and Platforming Problems for High-Speed Multiline Railway Network." Journal of Advanced Transportation 2021 (March 17, 2021): 1–16. http://dx.doi.org/10.1155/2021/6679008.
Full textAbstract:
The optimization problems of train timetabling and platforming are two crucial problems in high-speed railway operation; these problems are typically considered sequentially and independently. With the construction of high-speed railways, an increasing number of interactions between trains on multiple lines have led to resource assignment difficulties at hub stations. To coordinate station resources for multiline train timetables, this study fully considered the resources of track segments, station throat areas, and platforms to design a three-part space-time (TPST) framework from a mesoscopic perspective to generate a train timetable and station track assignment simultaneously. A 0-1 integer programming model is proposed, whose objective is to minimize the total weighted train running costs. The construction of a set of incompatible vertexes and links facilitates the expression of difficult constraints. Finally, example results verify the validity and practicability of our proposed method, which can generate conflict-free train timetables with a station track allocation plan for multiple railway lines at the same time.
8
Stojadinović, Nikola, Branislav Bošković, and Mirjana Bugarinović. "BRIDGING THE GAP BETWEEN INFRASTRUCTURE CAPACITY ALLOCATION AND MARKET-ORIENTED RAILWAY: AN ALGORITHMIC APPROACH." Transport 34, no. 6 (September 10, 2019): 708–21. http://dx.doi.org/10.3846/transport.2019.11035.
Full textAbstract:
The European Commission initiated the process of liberalization and introducing competition in the European railway sector more than twenty-five years ago. Despite the liberalization of the railway sector, train paths are currently administratively allocated in all EU countries using the train service priority criterion, which may not treat all train operators equally. This is especially evident in those network sections where demand exceeds the available capacity. In these situations, economic theory suggests the implementation of a market-based mechanism for allocation of capacity, such as auctions. However, due to its incompatibilities with priority criteria in the process of the capacity allocation, it is necessary to develop a new procedure to support the implementation of an auction. In this paper, the proposed algorithm fills the technological gap between train timetable design and train operator requests. The new algorithm for decentralized capacity allocation is the result of a multidimensional approach, which encompasses setting new relations between train operators and the infrastructure manager, train timetable drafting and resolving the conflicting request. In addition, the algorithm provides a feasible solution ensuring equal treatment of train operators and efficient allocation, in order to foster the development of the competition in the European rail market.
9
Ariessanti, Hani Dewi, Dwi Sloria Suharti, and Ary Budi Warsito. "OPTIMASI PENJADWALAN PERKULIAHAN MENGGUNAKAN METODEAUTO GENERATE TIMETABLE DENGAN ARRAY." CCIT Journal 11, no. 2 (August 18, 2018): 257–66. http://dx.doi.org/10.33050/ccit.v11i2.593.
Full textAbstract:
Scheduling is one of the many problems that has been done in research for many years. Problems preparing the schedule in college are about college scheduling. The timing process should be done for each semester, which is a tiring and time-consuming task. The overall allocation of events in timeslots and spaces is done by the course scheduling process by considering the list of hard constraints and soft constraints, so there is no conflict created in allocating the schedule. Therefore, it is necessary to create a lecture scheduling application that is able to facilitate and overcome the problems in organizing the lecture schedule. The proposed scheduling system design proposed in this study is to optimize the schedule of lectures using the Auto Generate Timetable method with arrays to find the best candidates for college scheduling with the aim of minimizing the conflict and optimizing the scheduling schedule. This method is based on the process of lecturing process that has been conducted in college. Every curriculum, space, day / time, is needed to arrange the schedule of students and lecturers as part of the scheduling variable that is the solution candidate. Then the process of adjusting to constraints has been made with various parameters. The research method is to collect the data, analysis, design, coding, testing and up to the maintenance phase by using the Waterfall System Development Lifecycle method. The waterfall model provides a life-cycle approach to the development of software systems in sequential or sequential form. So with the existence of this application, it is hoped that the arrangement of lectures will not find problems as a constraint in arranging the lecture schedule
10
Lee, Chang-Hun, Seong-Il Shin, and Si-Gon Kim. "Railway Timetable Considering Optimal Path Finding Method in Rail Network (Focused on Revenue Allocation)." Journal of the Korean society for railway 18, no. 2 (April 30, 2015): 149–56. http://dx.doi.org/10.7782/jksr.2015.18.2.149.
Full text
11
Lopateeva, Olga, Anatoly Popov, Alexey Ovsyankin, and Mikhail Satsuk. "Formation of the schedule at the university with the application of greedy algorithms." Informatization and communication 4 (November 2020): 91–96. http://dx.doi.org/10.34219/2078-8320-2020-11-4-91-96.
Full textAbstract:
A greedy resource allocation algorithm is understood as an algorithm according to which the resource allocation process can be represented as a sequence of steps. At each step, an optimal, under certain conditions, distribution of a part of the resources occurs, which does not change in the future. The problem of improving the quality of the organization of the educational process in a higher educational institution is solved on the basis of the use of greedy algorithms. A well-designed timetable should ensure an even workload of student groups and faculty. The purpose of this work is to develop an algorithm that can improve the quality of the formation of the educational schedule based on the use of greedy algorithms.
12
Zhang, Qin, Xiaoning Zhu, and Li Wang. "Track Allocation Optimization in Multi-Direction High-Speed Railway Stations." Symmetry 11, no. 4 (April 1, 2019): 459. http://dx.doi.org/10.3390/sym11040459.
Full textAbstract:
Track allocation optimization in railway stations is one of the most fundamental problems for scheduling trains, especially in multi-direction high-speed railway stations. With the construction of high-speed rail networks, this kind of station has become increasingly common. However, the track allocation depends not only on the station tracks, train timetable, and rolling stock plan, but also on the resources in the station throat area. As a result, an effective track allocation plan becomes significant but also difficult. In this paper, we consider all these factors to make the results more practicable and an integer linear model that minimizes the total occupation time of resources in the throat area is presented. A flexible track utilization rule is also adopted to this model to fit the characteristics of the multi-direction station. Meanwhile, a detailed explanation of resources’ occupation time is illustrated to facilitate the representation of the conflicting constraints. To resolve these issues, we use a commercial solver with its default parameters. A computational experiment of a station is conducted to verify the effectiveness of the proposed model. The resources utilization plan indicates that the capacity of a station is limited by the throat area, rather than by the station tracks.
13
Yang, Songpo, Feixiong Liao, Jianjun Wu, Harry J. P. Timmermans, Huijun Sun, and Ziyou Gao. "A bi-objective timetable optimization model incorporating energy allocation and passenger assignment in an energy-regenerative metro system." Transportation Research Part B: Methodological 133 (March 2020): 85–113. http://dx.doi.org/10.1016/j.trb.2020.01.001.
Full text
14
Giannetti, Daniela, Luca Pinto, and Andrea Pedrazzani. "Setting Parliamentary Calendars: How Parties Allocate Time for Plenary Debates on Bills." Political Studies 64, no. 4 (July 5, 2015): 1016–35. http://dx.doi.org/10.1111/1467-9248.12220.
Full textAbstract:
Compared to other aspects of agenda control, the organisation of legislative calendars has received scarce scholarly attention. However, setting the floor timetable affects parliament’s decisions and may therefore become crucial for understanding the policy-making process better. This article examines the allocation of speaking time for plenary debates on bills by combining an interparty perspective with a focus on the agenda-setting powers of collective directing bodies in the parliament. It shows that, due to time pressures, parties have to make explicit trade-offs among bill proposals. Using an original dataset including information about 472 bill proposals scheduled for floor debates in three Italian legislative terms in the period 2001–13, the article provides evidence that parties agree to schedule longer debates for divisive and salient issues, while they decide to move more quickly on less divisive proposals.
15
Wang, Zi Feng, Li Ruan, and Li Min Xiao. "A Rescheduling Algorithm of Train-Group for Railway Emergencies and its Parallelization." Advanced Materials Research 756-759 (September 2013): 3680–86. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.3680.
Full textAbstract:
In order to reduce the delays of train groups when suffering from railroad emergencies, we propose a rescheduling algorithm of train groups to reschedule trains, instead of previous just waiting. A heuristic algorithm is designed to search the proper path for the trains involved in the railroad emergencies. An evaluation criterion based on the extent of the disturbance towards the original timetable and limited time is designed to select the optimal path for each train. And a conflicts resolution strategy is designed to deal with the path and time conflicts among trains when rescheduling. In the end, due to the real-time needs of the railroad scheduling, we implement the parallel processing for the train-group rescheduling referring to the allocation of loads. Experimental results show that the rescheduling algorithm is efficient to reduce the delays of train groups and the parallel processing meets the real-time response of the train-group rescheduling well.
16
Sakaliuk, O., and F. Trishyn. "USING A GENETIC ALGORITHM TO SOLVE THE COURSES TIMETABLING CREATION PROBLEM." Automation of technological and business processes 13, no. 2 (August 2, 2021): 22–28. http://dx.doi.org/10.15673/atbp.v13i2.2053.
Full textAbstract:
Creating of courses timetable is an extremely difficult, time-consuming task and usually takes a long time. In many educational institutions, the courses schedule is developed manually. Schedule theory includes problems that are actually less complex than problems in practice, but theoretical analysis provides a fundamental understanding of the complexity of the schedule. The logical result is that the schedule is very difficult to build in practice due to many constraints [1].
Scheduling courses is a planning problem. In 1996, the problem of scheduling was described as the allocation of some resources with restrictions on a limited number of time intervals and at the same time to satisfy the set of stated objectives [2]. This is a general statement and is a common description of the courses timetabling creation problem. Schedule of courses is an important administrative activity in most educational institutions. The timetable problem is the distribution of classes by available audiences and time intervals, taking into account the constraints. We usually distinguish between two types of constraints: hard and soft. Hard constraints are compulsorily fulfilled by the educational institution. Decisions that do not violate hard constraints are called possible solutions.
With the development of the general theory of the schedule, the approaches to the formalization and solution of the courses timetabling creation problem in educational institutions also changed. Currently, the problem of automation of the courses timetabling creation remains relevant. The urgency of the problem is determined by the growing requirements for the quality of education, student work planning, rational use of the audiences, as well as taking into account additional optimization parameters. The task of finding the optimal schedule of courses in most cases belongs to the class of complex problems. If we take into account the real conditions, the problem is even more complicated, because the desired solutions must meet numerous constraints of production, organizational and psychophysiological nature, which contradict each other. The genetic algorithm helps to efficiently search for optimal solutions in spaces with a very large dimension.
17
Liu, Jianxiao, Wenzhong Shi, and Pengfei Chen. "Exploring Travel Patterns during the Holiday Season—A Case Study of Shenzhen Metro System During the Chinese Spring Festival." ISPRS International Journal of Geo-Information 9, no. 11 (October 30, 2020): 651. http://dx.doi.org/10.3390/ijgi9110651.
Full textAbstract:
Research has shown that the growing holiday travel demand in modern society has a significant influence on daily travel patterns. However, few studies have focused on the distinctness of travel patterns during a holiday season and as a specified case, travel behavior studies of the Chinese Spring Festival (CSF) at the city level are even rarer. This paper adopts a text-mining model (latent Dirichlet allocation (LDA)) to explore the travel patterns and travel purposes during the CSF season in Shenzhen based on the metro smart card data (MSC) and the points of interest (POIs) data. The study aims to answer two questions—(1) how to use MSC and POIs inferring travel purpose at the metro station level without the socioeconomic backgrounds of the cardholders? (2) What are the overall inner-city mobility patterns and travel activities during the Spring Festival holiday-week? The results show that six features of the CSF travel behavior are found and nine (three broad categories) travel patterns and trip activities are inferred. The activities in which travelers engaged during the CSF season are mainly consumption-oriented events, visiting relatives and friends and traffic-oriented events. This study is beneficial to metro corporations (timetable management), business owners (promotion strategy), researchers (travelers’ social attribute inference) and decision-makers (examine public service).
18
Arratia-Martinez, Nancy Maribel, Cristina Maya-Padron, and Paulina A. Avila-Torres. "University Course Timetabling Problem with Professor Assignment." Mathematical Problems in Engineering 2021 (January 26, 2021): 1–9. http://dx.doi.org/10.1155/2021/6617177.
Full textAbstract:
One of the decision problems in many organizations and institutions is to decide how to schedule different tasks, in particular, in higher education institutions. One of the main problems is the university course timetabling problem (UCTP): this problem consists of the allocation of events (courses, professors, and students) to a number of fixed time slots and rooms, this at the beginning of each academic period of the universities. The existent formulations include particular requirements from different educational levels and institutions, as in our case. In this paper, we focus on the university course timetabling problem with the assignment of professor-course-time slot for an institution in Mexico. Timetabling is constructed for the disciplinary courses that are offered by one of the academic departments. The main characteristics are as follows: (1) there are full-time and part-time professors; (2) a mandatory fixed number of courses has to be assigned to each full-time professor according to their academic profile; (3) there is a maximum number of courses assigned to part-time professors; (4) a professor-course matrix that specifies the valid assignation is defined; and (5) mandatory time periods for courses in different semesters are established and other traditional constraints. We present the integer linear programming model proposed to solve the case studied. The optimal solution was obtained with low computational effort through the classical branch-and-bound algorithm. We describe the complete timetable to show the model effectiveness.
19
J. Bendi, R. Kristoforus, and Hadi Junaidi. "SIMULATED ANNEALING APPROACH FOR UNIVERSITY TIMETABLE PROBLEM." Jurnal Ilmiah Matrik 21, no. 3 (December 19, 2019): 204–13. http://dx.doi.org/10.33557/jurnalmatrik.v21i3.723.
Full textAbstract:
Abstract : University Scheduling is a way of allocating students, lecturers, and rooms, which is used for lectures in the available time slots. The common problems are that a lecturer is scheduled in the same time slot, or several courses are scheduled in the same room and the same time slot. For this reason, scheduling needs to be made in such a way that it can optimize the use of resources. We use simulated annealing as an approach to solve that problem. The results showed that the higher the initial temperature value used and the greater the iteration value would reduce the violation constraints in scheduling problems.
20
BAYAR, Mustafa Mehmet, and Irmak UZUN BAYAR. "Conflict Management in University Examination Timetabling Problem: A case study of summer school mid-terms." Central European Review of Economics and Management 4, no. 3 (September 20, 2020): 67–87. http://dx.doi.org/10.29015/cerem.870.
Full textAbstract:
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
21
Firdaus Khair, Ahmad, Mokhairi Makhtar, Munirah Mazlan, Mohamad Afendee Mohamed, and Mohd Nordin Abdul Rahman. "Solving examination timetabling problem in UniSZA using ant colony optimization." International Journal of Engineering & Technology 7, no. 2.15 (April 6, 2018): 132. http://dx.doi.org/10.14419/ijet.v7i2.15.11369.
Full textAbstract:
At all educational institutions, timetabling is a conventional problem that has always caused numerous difficulties and demands that need to be satisfied. For the examination timetabling problem, those matters can be defined as complexity in scheduling exam events or non-deterministic polynomial hard problems (NP-hard problems). In this study, the latest approach using an ant colony optimisation (ACO) which is the ant system (AS) is presented to find an effective solution for dealing with university exam timetabling problems. This application is believed to be an impressive solution that can be used to eliminate various types of problems for the purpose of optimising the scheduling management system and minimising the number of conflicts. The key of this feature is to simplify and find shorter paths based on index pheromone updating (occurrence matrix). With appropriate algorithm and using efficient techniques, the schedule and assignation allocation can be improved. The approach is applied according to the data set instance that has been gathered. Therefore, performance evaluation and result are used to formulate the proposed approach. This is to determine whether it is reliable and efficient in managing feasible final exam timetables for further use.
22
Al-Yahyai, Fakhriya, Salman Alhajr, Mohammed Al-Amri, Badar Al-mamari, and Wissem Abdelmoula. "The Role of Open Art Studio in Encouraging University Students to Practice Art Activities." Journal of Arts and Social Sciences [JASS] 7, no. 2 (June 1, 2016): 427. http://dx.doi.org/10.24200/jass.vol7iss2pp427-429.
Full textAbstract:
The current study aims to explore the role of the Open Art Studio in encouraging university students to practice arts. It seeks to answer the following main research questions: What is the role of the Open Art Studio in enhancing university-students’ life in terms of educational, sociological and physiological aspects? The findings of the study show the importance of practicing art activities in the Open Art Studio in enhancing university-students’ life as well as analyzing the integrating role of the educational, physiological and sociological of practicing art in the Open Art Studio. This study ended with some important recommendations such as the importance of higher educational institutions in encouraging students’ participation in practicing all types of arts activities and supporting them and offering incentives, the necessity of art specialists participating at universities in planning policy of outside classrooms activities and supervising these activities according to their specializations, and allocating some time in the study timetable for practicing extracurricular activities in all university disciplines. Finally, it recommends the need to further study the difficulties behind the university students’ limited number of visits to Open Art Studios.
23
Duraj, Tomasz. "GRANICE UPRAWNIEŃ KIEROWNICZYCH PRACODAWCY W STOSUNKU PRACY." Zeszyty Prawnicze 13, no. 2 (December 13, 2016): 101. http://dx.doi.org/10.21697/zp.2013.13.2.06.
Full textAbstract:
THE LIMITS OF THE MANAGEMENT AUTHORITY IN THE EMPLOYMENT RELATIONSHIPSummaryManagement authority, which is guaranteed for the employer under the employment relationship with respect to employees, is an essential (necessary) feature of the employment relationship, which very often determines the identity of this relationship, distinguishing it from other legal forms of employment, especially those of a civil nature. The employing entity’s management authority must first of all be identified with the employer’s powers to influence the employee’s actions within the scope of the performance of work (in the work process) and the employee’s corresponding obligations to the employing entity regarding the work he is to perform. Using these powers, the employer specifies the employee’s obligations for the performance of the job, in particular its type, method, the time and place in which it is to be done, as well as the order and organization of the work process. According to the literature on the subject, the employer’s main powers of management include prescriptive rights (the core of management authority), which allow him to specify the employee’s duties by issuing binding instructions to him; punitive (disciplinary) powers associated with the use of disciplinary penalties; regulatory (legislative) powers, primarily to establish the regulations and other acts determining working order (in particular work schedules, holiday timetables etc.); and distributive power (the allocation of prizes and awards). The object of this study is to characterize the limits to the employer’s management authority in the employment relationship. The author concentrates on the limits defined by applicable law, the employment contract, the clause of compliance with socio-economic purpose, and the rules of social coexistence, as well as custom. The analysis of the limits of the employer’s management authority shows the importance of this issue, both in theoretical and practical terms. The appropriate configuration of these limits may help to solve one of the fundamental problems of modern labor law, which is to harmonize its protective and organizational functions.
24
H., Divya, Nandhini S., Shobana S., and M. Sujithra. "EXAMINATION MANAGEMENT SYSTEM." International Journal of Advanced Research 9, no. 01 (January 31, 2021): 920–23. http://dx.doi.org/10.21474/ijar01/12370.
Full textAbstract:
Examinations are a scary subject discuss among students and even for teachers. Examinations require very smooth functioning of exams and it is dependent on managers establishing the processes and a working relationship with the Exam Centre Manager. Also communicating these with staff and students ensures everyone is working towards the same goal. Automated systems can bring all the hassle related to examination management to ease. Academia ERP is a comprehensive system that provides Examination Module which covers all the activities related to management of examination directly from receipt of Enrolments Forms and Examination Forms through the processing of Results and Printing of Certificates and Statistical Reports etc. The Examination module involves all the necessary forms that are needed for the student to fill up to register for exams. The module is connected to the student database; therefore, it helps in retrieving all necessary information about the student on just filling in the Id/ name/ enrolment etc.Academia’s Examination module provides the followings for easy and effective management of examinations at the institute- Academic or examination module follows systematic workflow beginning for pre-examination setup, student marks update to defining different reports etc.Exam Management module in Academia ERP is an excellent automation system that can effectively automate and streamline planning and execution of the exams, and it has been designed to make the examination processes efficient and also paper free. Academia’s Exam Management portal helps you to automate the entire examination process from Pre-exam preps like the creation of test papers, Exam timetable and grading criteria etc. to handling logistics and allocating invigilators. The automation systems are designed to manage access permissions for different users to prevent misuse and mismanagement of legal and official data by an unauthorized user for not only exam info but various other data as well. This project aims on developing an efficient platform for managing examination systems. It consists different modules as described above. The student and examination details are stored in a database.
25
ROUSSEL, FLORIAN, and IRENA RUSU. "HOLES AND DOMINOES IN MEYNIEL GRAPHS." International Journal of Foundations of Computer Science 10, no. 02 (June 1999): 127–46. http://dx.doi.org/10.1142/s0129054199000113.
Full textAbstract:
Many practical problems (frequency assignement, register allocation, timetables) may be formulated as graph (vertex-)coloring problems, but finding solutions for them is difficult as long as they are treated in the most general case (where the graph is arbitrary), since vertex coloring has been proved to be NP-complete. The problem becomes much easier to solve if the graph resulting from the modelisation of the practical application belongs to some particular class of graphs, for which solutions to the problem are known. Meyniel graphs form such a class (a fast coloring algorithm can be found in [9]), for which an efficient recognizing algorithm is therefore needed. A graph G=(V,E) is said to be a Meyniel graph if every odd cycle of G on at least five vertices contains at least two chords. Meyniel graphs generalize both i-triangulated and parity graphs, two well known classes of perfect graphs that will be present in our paper in Section 7. In [2], Burlet and Fonlupt propose a characterization of Meyniel graphs which relies on the following property: the class of Meyniel graphs may be obtained from some basic Meyniel graphs using a binary operation called amalgam. Besides the theoretical interest of this result, a practical interest arises because of the polynomial recognition algorithm which can be obtained. Unfortunately, it is quite expensive to verify if a given graph is the amalgam of two graphs (therefore the complexity of the whole algorithm is in O(n7)), and this supports the idea that a new point of view is needed to find a more efficient algorithm. Our approach of Meyniel graphs will be directed through the search of a general structure. Intuitively, a Meyniel graph either will be simple (i.e. with no hole or domino), or will have a skeleton around which the rest of the graph will be regularly organized. As suggested, the first type of Meyniel graphs is simple to identify. For the second type, a deeper analysis is necessary; it yields a characterization theorem, which is used to deduce the O(m2+mn) recognition algorithm.
26
Palmqvist, Carl-William, Nils O.E. Olsson, and Lena Winslott Hiselius. "Some influencing factors for passenger train punctuality in Sweden." International Journal of Prognostics and Health Management 8, no. 3 (November 17, 2020). http://dx.doi.org/10.36001/ijphm.2017.v8i3.2649.
Full textAbstract:
Punctuality is regarded as an important measure of the performance of a railway system, and is the one most commonly used and discussed measure both in the industry and among travelers. In many countries, the punctuality of trains, and thus the performance of the railway system, is deemed as lacking. The aim of this article is to study and quantify how several weather-, timetable, operational and infrastructure-related variables influence punctuality in passenger train traffic. This can contribute to better understanding of the performance of railway systems, and help identify possible improvements. The study is based on a dataset containing detailed timetables and records of all 32.4 million train movements for all trains in Sweden during the year of 2015, over 1.1 million departures. Supporting this is a comprehensive register of over 80 000 infrastructure elements, and almost 87 million weather observations. We consider the size and allocation of margins, the existence of negative margins, two measures for traffic volume, the journey time and distance, how often different vehicle individuals are used, the number of line and station interactions between trains, the amount of precipitation, the temperature, wind speed, snow depth, and eight types of infrastructure elements. We show how these variables affect punctuality, and estimate how much of the variation in punctuality can be explained by them. The findings can be used to design timetables, change operational parameters and modify infrastructure design so that punctuality improves. They can also help identify areas which should be prioritized in planning, maintenance and research.