Rozprawy doktorskie na temat „Timetabling”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Timetabling”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Weare, Rupert. "Automated examination timetabling". Thesis, University of Nottingham, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282578.
Pełny tekst źródłaIsmail, Zuhaimy H. "Aspects of computerised timetabling". Thesis, Loughborough University, 1994. https://dspace.lboro.ac.uk/2134/13825.
Pełny tekst źródłaHellkvist, Henning, i William Sjöstedt. "Toward Automated Timetabling at TekNat". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-169531.
Pełny tekst źródłaMurugan, Anandaraj Soundarya Raja. "University Timetabling using Genetic Algorithm". Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3792.
Pełny tekst źródłaPendlebury, J. "A computer-aided timetabling system". Thesis, Lancaster University, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.277233.
Pełny tekst źródłaAbdul, Rahman Syariza. "Search methodologies for examination timetabling". Thesis, University of Nottingham, 2012. http://eprints.nottingham.ac.uk/12709/.
Pełny tekst źródłaNewall, James P. "Hybrid methods for automated timetabling". Thesis, University of Nottingham, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.285687.
Pełny tekst źródłaLindberg, Viktor. "Evaluation of School Timetabling Algorithms". Thesis, Umeå universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-128602.
Pełny tekst źródłaJeřábková, Eva. "Timetabling - příprava rozvrhu pro školu". Master's thesis, Vysoká škola ekonomická v Praze, 2014. http://www.nusl.cz/ntk/nusl-198439.
Pełny tekst źródłaArbaoui, Taha. "Modeling and solving university timetabling". Thesis, Compiègne, 2014. http://www.theses.fr/2014COMP2167/document.
Pełny tekst źródłaThis thesis investigates university timetabling problems. These problems occur across universities and are faced each year by the practitioners. We propose new lower bounds, heuristic approaches, mixed integer and constraint programming models to solve them. We address the exam timetabling and the student scheduling problem. We investigate new methods and formulations and compare them to the existing approaches. For exam timetabling, we propose an improvement to an existing mixed integer programming model that makes it possible to obtain optimal solutions. Next, lower bounds, a more compact reformulation for constraints and a constraint programming model are proposed. For the exam timetabling problem at Université de Technologie de Compiègne, we designed a memetic approach. Finally, we present a new formulation for the student scheduling problem and investigate its performance on a set of real-world instances
Lewis, Rhydian M. R. "Metaheuristics for university course timetabling". Thesis, Edinburgh Napier University, 2006. http://researchrepository.napier.ac.uk/Output/2392.
Pełny tekst źródłaPlacì, Simone. "Modelli per il Train Timetabling Problem". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019.
Znajdź pełny tekst źródłaMarte, Michael. "Models and Algorithms for School Timetabling". Diss., lmu, 2002. http://nbn-resolving.de/urn:nbn:de:bvb:19-9369.
Pełny tekst źródłaLayfield, Colin J. "Investigations into the master timetabling problem". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ34973.pdf.
Pełny tekst źródłaAutry, Brian M. "University course timetabling with probability collectives". Thesis, Monterey, Calif. : Naval Postgraduate School, 2008. http://bosun.nps.edu/uhtbin/hyperion-image.exe/08Mar%5FAutry.pdf.
Pełny tekst źródłaThesis Advisor(s): Squire, Kevin. "March 2008." Description based on title screen as viewed on April 24, 2008. Includes bibliographical references (p. 33-35). Also available in print.
Cartlidge, Christopher James. "Automated scheduling for timetabling of coursework /". Leeds : University of Leeds, School of Computer Studies, 2008. http://www.comp.leeds.ac.uk/fyproj/reports/0708/Cartlidge.pdf.
Pełny tekst źródłaKoshich, P. A. "University course timetabling of meta-heuristics". Thesis, University of Oxford, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433470.
Pełny tekst źródłaAbdullah, Salwani. "Heuristic approaches for university timetabling problems". Thesis, University of Nottingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.428959.
Pełny tekst źródłaFang, Hsiao-Lan. "Genetic algorithms in timetabling and scheduling". Thesis, University of Edinburgh, 1995. http://hdl.handle.net/1842/30185.
Pełny tekst źródłaBradley, Matthew John. "Ultra-efficient Bus Rapid Transit timetabling". Thesis, Curtin University, 2010. http://hdl.handle.net/20.500.11937/75.
Pełny tekst źródłaAizam, Nur Aidya Hanum. "Effective computational models for timetabling problem". Thesis, Curtin University, 2013. http://hdl.handle.net/20.500.11937/827.
Pełny tekst źródłaHederra, Francisco J. "Timetabling courses at the Naval Postgraduate School". Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1994. http://handle.dtic.mil/100.2/ADA288398.
Pełny tekst źródłaRanson, David John. "Interactive Visualisations to Improve Exam Timetabling Systems". Thesis, University of Sussex, 2008. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.487898.
Pełny tekst źródłaNaseem, Jat Sadaf. "Genetic algorithms for university course timetabling problems". Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/10997.
Pełny tekst źródłaTannahill, Samuel Coulter. "The school timetabling problem : a new formulation". Thesis, University of Strathclyde, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.250706.
Pełny tekst źródłaDANTAS, VITOR CAVALCANTI. "ALGORITHMS FOR POST ENROLLMENT-BASED COURSE TIMETABLING". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2009. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=13807@1.
Pełny tekst źródłaCOORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR
Problemas de Programação de Horários (PPHs) tem sido amplamente estudados, dada a sua importância prática e teórica. A maioria das variações do problema pertence µa classe NP-Difícil. Em geral, trata-se da alocação de recursos materiais e humanos no espaço e no tempo, visando a otimização de um conjunto de objetivos definidos. Na Programação de Horários de Cursos Universitários, por exemplo, o objetivo pode ser a satisfação do corpo docente e o desempenho acadêmico dos alunos. Nos últimos anos, as formulações de PPHs propostas pela International Timetabling Competition (ITC) tem sido bastante utilizadas, sendo notável a predominância de métodos baseados em busca local e metaeurísticas entre as abordagens propostas recentemente. Este trabalho tem como objetivo propor algoritmos para o Problema de Programação de Horários Pós-Matrícula da ITC, focando principalmente em métodos heurísticos baseados em Programação Matemática. Entre os modelos de Programação Linear Inteira Mista que propomos para este problema, destaca-se o modelo baseado na Formulação de Representantes Assimétricos para o Problema de Coloração de Grafos. Abordamos a aplicação da heurística de Local Branching e propomos um esquema de resolução por Geração de Colunas, como forma de viabilizar o tratamento dos modelos propostos, uma vez que a complexidade de tais modelos representa um desafio para os resolvedores de Programação Linear Inteira Mista atualmente disponíveis.
Timetabling Problems have been widely studied, given its practical and theorical relevance. Most of its variations belong to the NP-Hard class of problems. In general, it is about allocation of material and human resources in time and space, aiming to optimize some set of defined objetives. In University Course Timetabling, for example, the objective might be the satisfaction of professors and the academic performance of students. In the last years, the formulations for timetabling problems proposed by the In- ternational Timetabling Competition (ITC) have been widely adopted. The predominance of meta-heuristics and local search-based methods is remark- able among the recently proposed approaches. The objetive of this thesis is to propose algorithms for the Post Enrolment-based Course Timetabling Problem of the ITC, focusing on Mathematical Programming-based heuris- tic methods. Among the Mixed Integer Linear Programming models that we propose for this problem, we highlight the one based on the Asymetric Representatives Formulation for the Graph Coloring Problem. We explore the application of the Local Branching heuristic and we propose a Column Generation solution procedure, as an attempt to handle the proposed models, given that the complexity of such models poses a challenge for currently available Mixed Integer Linear Programming solvers.
Qu, Rong. "Case-based reasoning for course timetabling problems". Thesis, University of Nottingham, 2002. http://eprints.nottingham.ac.uk/10020/.
Pełny tekst źródłaJoubert, Guillaume. "Periodic train timetabling with mesoscopic tracks assignment". Electronic Thesis or Diss., Compiègne, 2023. http://www.theses.fr/2023COMP2775.
Pełny tekst źródłaAs the French railway Infrastructure Manager, SNCF Réseau produces train timetables on a yearly basis, by deciding a set of time intervals on tracks to allow safe trains circulation that fulfils a mobility demand from the Transport Organisation Authority (TOA): this is a periodic slot scheduling task. This PhD project aims at providing a decision-aid tool to the timetable planners, in a context where the mobility demand expressed by the TOA and the infrastructure state change from a year to another. We focus on a production phase said capacity structuring, where the problem is to decide whether from a known slots demand and infrastructure state, there is a periodic scheduling fulfilling this slots demand and satisfying the safety constraints arising from rail operations. We propose two methods to solve this problem. The first method is based on an Integer Linear Programming model inspired from the literature and that we decomposed to ease the solution search. The timetable determination is then made before the tracks assignment. A conflict evaluation function that does not require explicit tracks assignment knowledge is used to obtain conflict-free timetables for which a tracks assignment is reachable. In order to solve challenging instances, we propose a constructive heuristic and a tabu search framework to resolve conflicts moreefficiently. The second method relies on a Constraint Programming model that we use to optimise the turnover time of rolling stock at terminus stations. We developed filtering algorithms to improve algorithms that maintain the arc-consistency of precedence and disjunctive constraints of the problem, all having a periodic aspect. We propose lower bounds based on the minimal cost contribution of slots subsets to the objective function in order to improve the optimality proof of the solutions. Finally, we present branching strategies and a Branch-and-Check procedure to improve the resolution performance.These approaches are tested on different instances of the problem, based on two fictive infrastructures as well as on the Savoie area centred around Chambéry - Challes-les-Eaux station
Chammas, Kristoffer, i Simon Sirak. "An Evaluation of the Great Deluge Algorithm in Course Timetabling : As Applied to the KTH-Inspired University Course Timetabling Problem". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-259907.
Pełny tekst źródła”The University Course Timetabling Problem” (UCTP) handlar i grova drag om att, baserat på ett antal kriterier, schemalägga föreläsningar, övningar och laborationer på ett optimalt sätt. Problemets relevans har ökat allt eftersom universitet utökar sina programutbud. På grund av komplexiteten hos UCTP löses problemet vanligtvis approximativt med hjälp av heuristiker. ”KTH-inspired UCTP” är en KTH-anpassad variant av UCTP för vilken endast ett fåtal heuristiker har implementerats. Denna variant har exempelvis inte lösts av en vanlig heuristik inom UCTP, ”The Great Deluge” (GD). Denna studie fokuserar därför på att applicera GD på ”KTH-inspired UCTP” och jämföra denna med äldre implementationer, med fokus på den bästa tillgängliga implementationen. GD-implementationen jämförs med den bästa tillgängliga implementationen för ”KTH-inspired UCTP” för olika tidsgränser. Kvaliteten hos de resulterande schemana evalueras och sparas sedan över flera körningar. Jämförelsen gjordes på två probleminstanser av olika komplexitet. Resultatet av jämförelsen föreslår att GD producerade bättre scheman för högre tidsgränser men sämre scheman för lägre tidsgränser. Vidare analys föreslår att denna förbättring beror på utnyttjandet av det giriga beteendet som vår GD-implementation uppvisar vid senare delar av exekvering.
Aldogan, Deniz. "Memetic Algorithms For Timetabling Problems In Private Schools". Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/3/12606218/index.pdf.
Pełny tekst źródłaKraft, Christine R. "Planning, scheduling, and timetabling in a university setting". Connect to this title online, 2007. http://etd.lib.clemson.edu/documents/1193079304/.
Pełny tekst źródłaZhang, Lixi. "Solving the timetabling problem using constraint satisfaction programming". Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20051104.155838/index.html.
Pełny tekst źródłaZibran, Minhaz Fahim, i University of Lethbridge Faculty of Arts and Science. "A multi-phase approach to university course timetabling". Thesis, Lethbridge, Alta. : University of Lethbridge, Faculty of Arts and Science, 2007, 2007. http://hdl.handle.net/10133/633.
Pełny tekst źródłaix, 117 leaves ; 29 cm
Mohmad, Kahar Mohd Nizam. "Heuristic approaches for real world examination timetabling problems". Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/27677/.
Pełny tekst źródłaYang, Yong. "Solving examination timetabling problems by case based reasoning". Thesis, University of Nottingham, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416893.
Pełny tekst źródłaSaviniec, Landir. "Models and algorithms for high school timetabling problems". Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-05022018-112623/.
Pełny tekst źródłaProblemas de horários escolares consistem em alocar encontros entre turmas e professores, com objetivo de minimizar violações a requisitos qualitativos específicos. Esta categoria de problemas tem sido largamente estudada desde 1950, particularmente via técnicas de programação linear inteira mista e metaheurísticas. Entretanto, a computação de soluções ótimas ou quase ótimas usando programas inteiro-mistos ou metaheurísticas ainda é um desafio na maioria dos problemas práticos. Nesta tese, nós investigamos novas formulações inteiro-mistas, decomposições por geração de colunas e algoritmos baseados em metaheurísticas paralelas para computar limitantes inferiores e soluções para problemas de horários escolares. Extensivos experimentos computacionais conduzidos com instâncias reais demonstram que nossas melhores formulações são competitivas com as melhores formulações existentes, enquanto nossos algoritmos paralelos são superiores em performance computacional quando comparados com métodos que são estado-da-arte.
Muklason, Ahmad. "Hyper-heuristics and fairness in examination timetabling problems". Thesis, University of Nottingham, 2017. http://eprints.nottingham.ac.uk/42912/.
Pełny tekst źródłaSrinivasan, Subhashini. "Modeling the Homeschool timetabling problem using Integer programming". VCU Scholars Compass, 2011. http://scholarscompass.vcu.edu/etd/2555.
Pełny tekst źródłaSilva, Jose, Noel Varela, Jesus Varas, Omar Lezama, José Maco i Martín Villón. "Comparison of bioinspired algorithms applied to the timetabling problem". Springer Science and Business Media Deutschland GmbH, 2021. http://hdl.handle.net/10757/654075.
Pełny tekst źródłaRevisión por pares
Chohan, Ossam. "University Scheduling using Genetic Algorithm". Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791.
Pełny tekst źródłaKang, Le. "A logic approach to conflict resolution in university timetabling". Thesis, University of Ottawa (Canada), 1990. http://hdl.handle.net/10393/5767.
Pełny tekst źródłaBorges, Suzan Kelly. "Resoluçao de Timetabling utilizando algoritmos genéticos e evoluçao cooperativa". reponame:Repositório Institucional da UFPR, 2011. http://hdl.handle.net/1884/25068.
Pełny tekst źródłaFarivar, Saeid. "An algorithm-independent platform to solve university timetabling problems". Thesis, California State University, Long Beach, 2013. http://pqdtopen.proquest.com/#viewpdf?dispub=1522628.
Pełny tekst źródłaFinding optimal solutions for large scale university timetabling problems that satisfy all operational needs and rules in an academic institution, while at the same time fulfill as many of the wishes and requirements of the lecturers and the students as possible, is an important but extremely difficult task for the staff involved. Hence, automating this entire process seems to be inevitable. As timetabling problems are in general NP-complete, several heuristic algorithms have been proposed and applied to solve the problem in the literature. But prior to implementation, it is not clear which would perform better for any specific timetabling problem. This triggers the need for developing an algorithm independent platform that could interface with all solver engines. The main objectives of this work are the following: i) Providing an algorithm-independent tool that can be used to define the resources needed to create and modify an academic schedule, ii) Automatically generate schedules that better fit the needs of both lecturers and students, and iii) Reduce the labor cost involved in the university timetabling problem process.
Eckersley, Adam. "Novel knowledge based and heuristic approaches to university timetabling". Thesis, Nottingham Trent University, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.444607.
Pełny tekst źródłaHussin, Naimah Mohd. "Tabu search based hyper-heuristic for examination timetabling problem". Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423286.
Pełny tekst źródłaAndersson, Jerker. "Solving the Train Timetabling Problem by using Rapid Branching". Thesis, KTH, Optimeringslära och systemteori, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-181308.
Pełny tekst źródłaDen här uppsatsen handlar om en implementering av rapid branching för att hitta en heltalslösning till optimeringsproblemet vid tidtabelläggning för järnvägar. Rapid branching är en algoritm skapad för att fungera bra på storskaliga heltals-optimeringsproblem. I uppsatsen beskrivs några sätt att skapa egen tidtabelläggnings problem och sedan jämförs rapid branching med en vanlig heltalslösare för de problemen. Genom att göra detta visas att algoritmen rapid branching kan vara både snabbare och långsammare än att använda en konventionell heltalslösare. För den mest realistiska instansen av tidtabelläaggning problemet visade det sig att rapid branching var snabbare än heltalslösaren samt att den funna lösningen var av satisfierande hög kvalitet.
Asmuni, Hishammuddin. "Fuzzy methodologies for automated University timetabling solution construction and evaluation". Thesis, University of Nottingham, 2008. http://eprints.nottingham.ac.uk/10514/.
Pełny tekst źródłaAndrén, Axel. "Graphical User Interface for Timetabling at TekNat with Standardised Output". Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-275105.
Pełny tekst źródłaDornelles, Arton Pereira. "A matheuristic approach for solving the high school timetabling problem". reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/140451.
Pełny tekst źródłaThe school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of time, satisfying requirements of different types. Given the combinatorial nature of this problem, solving medium and large instances of timetabling to optimality is a challenging task. When resources are tight, it is often difficult to find even a feasible solution. Several techniques have been developed in the scientific literature to tackle the high school timetabling problem, however, robust solvers do not exist yet. Since the use of exact methods, such as mathematical programming techniques, is considered impracticable to solve large real world instances, metaheuristics and hybrid metaheuristics are the most used solution approaches. In this research we develop techniques that combine mathematical programming and heuristics, so-called matheuristics, to solve efficiently and in a robust way some variants of the high school timetabling problem. Although we pay special attention to problems arising in Brazilian institutions, the proposed methods can also be applied to problems from different countries.
Bukenberger, Jesse Paul. "A Set Union Based Formulation for Course Scheduling and Timetabling". DigitalCommons@CalPoly, 2014. https://digitalcommons.calpoly.edu/theses/1250.
Pełny tekst źródła