On the public citation graph

The University Course Timetabling Problem with a Three-Phase Approach

https://doi.org/10.1007/11593577_7
0 signed · 100 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44629-x_7openalex-snapshot
Tabu Search Techniques for Examination Timetabling
inferredcites →https://doi.org/10.1007/3-540-45724-0_1openalex-snapshot
A MAX-MIN Ant System for the University Course Timetabling Problem
inferredcites →https://doi.org/10.1007/978-3-540-45157-0_22openalex-snapshot
A Comparison of the Performance of Different Metaheuristics on the Timetabling Problem
inferredcites →https://doi.org/10.1007/bfb0055878openalex-snapshot
Recent developments in practical course timetabling
inferredcites →https://doi.org/10.1007/bfb0055884openalex-snapshot
Some observations about GA-based exam timetabling
inferredcites →https://doi.org/10.1007/bfb0056928openalex-snapshot
Timetabling the classes of an entire university with an evolutionary algorithm
inferredcites →https://doi.org/10.1016/s0305-0548(97)00101-9openalex-snapshot
A robust simulated annealing based examination timetabling system
inferredcites →https://doi.org/10.1016/s0305-0548(99)00051-9openalex-snapshot
Timetable planning using the constraint-based reasoning
inferredcites →https://doi.org/10.1016/s0360-8352(02)00180-8openalex-snapshot
Hopfield neural networks for timetabling: formulations, methods, and comparative results
inferredcites →https://doi.org/10.1016/s0377-2217(96)00111-7openalex-snapshot
The combinatorics of timetabling
inferredcites →https://doi.org/10.1023/a:1006576209967openalex-snapshot
A Survey of Automated Timetabling
inferredcites →https://doi.org/10.1038/sj.jors.2601115openalex-snapshot
Extended clique initialisation in examination timetabling
inferredcites →https://doi.org/10.1057/jors.1996.37openalex-snapshot
Examination Timetabling: Algorithmic Strategies and Applications
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/6462.6502openalex-snapshot
Efficient algorithms for finding maximum matching in graphs
inferredcites →https://doi.org/10.1201/b12336-12openalex-snapshot
Introduction to Graph Theory
inferredcites →https://doi.org/10.1287/inte.24.3.109openalex-snapshot
A General Examination Scheduling System
inferredcites →https://doi.org/10.2298/yjor0302139bopenalex-snapshot
A time-predefined approach to course timetabling
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4757706openalex-extracted
Personalized Course Timetabling by Adaptive Multi-Objective Neighborhood Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-71921-4_8openalex-snapshot
Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-39512-4_80openalex-snapshot
Development of a Solution Model for Timetabling Problems Through a Binary Integer Linear Programming Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-81054-2_9openalex-snapshot
Designing University Timetables
inferred← citeshttps://doi.org/10.1007/978-3-031-60994-7_21openalex-snapshot
Study of Machine Learning Models for IoT Based Efficient Classroom Usage
inferred← citeshttps://doi.org/10.1007/978-3-319-12799-6_2openalex-snapshot
The University Course Timetabling Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-12799-6_3openalex-snapshot
Fairness in Academic Course Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-48584-1_9openalex-snapshot
Metaheuristics for University Course Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-540-77345-0_3openalex-snapshot
Measurability and Reproducibility in University Timetabling Research: Discussion and Proposals
inferred← citeshttps://doi.org/10.1007/978-3-540-88636-5_64openalex-snapshot
An Efficient Simulated Annealing Algorithm for Feasible Solutions of Course Timetabling
inferred← citeshttps://doi.org/10.1007/978-3-642-21501-8_56openalex-snapshot
Chemical Signaling as a Useful Metaphor for Resource Management
inferred← citeshttps://doi.org/10.1007/978-3-642-38703-6_45openalex-snapshot
A Modified Artificial Bee Colony Algorithm for Post-enrolment Course Timetabling
inferred← citeshttps://doi.org/10.1007/s00291-007-0097-0openalex-snapshot
A survey of metaheuristic-based techniques for University Timetabling problems
inferred← citeshttps://doi.org/10.1007/s00500-022-07810-5openalex-snapshot
Modified and hybridised bi-objective firefly algorithms for university course scheduling
inferred← citeshttps://doi.org/10.1007/s10479-010-0696-zopenalex-snapshot
A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
inferred← citeshttps://doi.org/10.1007/s10479-010-0708-zopenalex-snapshot
An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
inferred← citeshttps://doi.org/10.1007/s10479-010-0737-7openalex-snapshot
Local search and constraint programming for the post enrolment-based course timetabling problem
inferred← citeshttps://doi.org/10.1007/s10479-010-0769-zopenalex-snapshot
A harmony search algorithm for university course timetabling
inferred← citeshttps://doi.org/10.1007/s10479-012-1078-5openalex-snapshot
Solving the post enrolment course timetabling problem by ant colony optimization
inferred← citeshttps://doi.org/10.1007/s10479-012-1081-xopenalex-snapshot
Curriculum-based course timetabling with SAT and MaxSAT
inferred← citeshttps://doi.org/10.1007/s10479-012-1160-zopenalex-snapshot
Timetable construction: the algorithms and complexity perspective
inferred← citeshttps://doi.org/10.1007/s10479-014-1553-2openalex-snapshot
Fairness in academic course timetabling
inferred← citeshttps://doi.org/10.1007/s10479-019-03382-0openalex-snapshot
Decomposition of university course timetabling
inferred← citeshttps://doi.org/10.1007/s10479-024-06363-0openalex-snapshot
Multi-objective hybrid optimizations for designing course schedules based on operating costs and resource utilization
inferred← citeshttps://doi.org/10.1007/s10489-016-0828-5openalex-snapshot
Common lecturers timetabling among departments based on funnel-shape clustering algorithm
inferred← citeshttps://doi.org/10.1007/s10878-012-9521-8openalex-snapshot
On the performance of Scatter Search for post-enrolment course timetabling problems
inferred← citeshttps://doi.org/10.1007/s10951-005-4780-1openalex-snapshot
A Computational Study of a Cutting Plane Algorithm for University Course Timetabling
inferred← citeshttps://doi.org/10.1007/s10951-006-8495-8openalex-snapshot
An effective hybrid algorithm for university course timetabling
inferred← citeshttps://doi.org/10.1007/s10951-010-0171-3openalex-snapshot
Complex university course timetabling
inferred← citeshttps://doi.org/10.1007/s10951-011-0258-5openalex-snapshot
A hyperheuristic approach to examination timetabling problems: benchmarks and a new problem from practice
inferred← citeshttps://doi.org/10.1007/s10951-015-0458-5openalex-snapshot
Late acceptance hill-climbing for high school timetabling
inferred← citeshttps://doi.org/10.1007/s10951-023-00801-wopenalex-snapshot
Real-world university course timetabling at the International Timetabling Competition 2019
inferred← citeshttps://doi.org/10.1007/s11750-015-0366-zopenalex-snapshot
An overview of curriculum-based course timetabling
inferred← citeshttps://doi.org/10.1007/s12597-020-00444-xopenalex-snapshot
An effective hybrid local search approach for the post enrolment course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.04.034openalex-snapshot
An iterated local search algorithm for the University Course Timetabling Problem
inferred← citeshttps://doi.org/10.1016/j.cie.2014.11.010openalex-snapshot
A survey of approaches for university course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2011.09.014openalex-snapshot
Design, engineering, and experimental analysis of a simulated annealing approach to the post-enrolment course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2012.03.011openalex-snapshot
A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.cor.2013.11.012openalex-snapshot
Variable Neighborhood Search based algorithms for high school timetabling
inferred← citeshttps://doi.org/10.1016/j.cor.2017.09.014openalex-snapshot
Random partial neighborhood search for the post-enrollment course timetabling problem
inferred← citeshttps://doi.org/10.1016/j.ijpe.2013.04.026openalex-snapshot
An ant colony based timetabling tool
inferred← citeshttps://doi.org/10.1016/j.jocs.2014.04.002openalex-snapshot
University course timetabling using hybridized artificial bee colony with hill climbing optimizer
inferred← citeshttps://doi.org/10.1016/j.protcy.2013.12.213openalex-snapshot
A Simulated Annealing for Tahmidi Course Timetabling
inferred← citeshttps://doi.org/10.1080/01605682.2018.1468862openalex-snapshot
Simulated annealing with improved reheating and learning for the post enrolment course timetabling problem
inferred← citeshttps://doi.org/10.1080/10556781003664739openalex-snapshot
A clique-based algorithm for constructing feasible timetables
inferred← citeshttps://doi.org/10.1108/ijshe-11-2020-0461openalex-snapshot
Managing campus parking demand through course scheduling – an approach to campus sustainability
inferred← citeshttps://doi.org/10.1109/afros62115.2024.11037030openalex-snapshot
A Study of Approaches for Academic Scheduling Problems
inferred← citeshttps://doi.org/10.1109/cec.2013.6557632openalex-snapshot
Memetic Algorithms for the High School Timetabling Problem
inferred← citeshttps://doi.org/10.1109/cse/euc.2019.00056openalex-snapshot
A Novel Memetic Algorithm Incorporating Greedy Stochastic Local Search Mutation for Course Scheduling
inferred← citeshttps://doi.org/10.1109/dmo.2009.5341898openalex-snapshot
Hybrid Ant Colony systems for course timetabling problems
inferred← citeshttps://doi.org/10.1109/his.2011.6122088openalex-snapshot
Designing a multi-agent approach system for distributed course timetabling
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4809055openalex-snapshot
Solving the Course Scheduling Problem Using Simulated Annealing
inferred← citeshttps://doi.org/10.1109/icac49085.2019.9103403openalex-snapshot
Intelligent Timetable Scheduler: A Comparison of Genetic, Graph Coloring, Heuristic and Iterated Local Search Algorithms
inferred← citeshttps://doi.org/10.1109/icaci.2016.7449863openalex-snapshot
A new time-dependent algorithm for post enrolment-based course timetabling problem
inferred← citeshttps://doi.org/10.1109/iccnt.2010.24openalex-snapshot
Best-Worst Ant Colony System Parameter Investigation by Using Experimental Design and Analysis for Course Timetabling Problem
inferred← citeshttps://doi.org/10.1109/icici-bme.2017.8537723openalex-snapshot
Novel Local Searches for Finding Feasible Solutions in Educational Timetabling Problem
inferred← citeshttps://doi.org/10.1109/icis.2007.25openalex-snapshot
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
inferred← citeshttps://doi.org/10.1109/icste.2010.5608807openalex-snapshot
A two-phase evolutionary algorithm for the university course timetabling problem
inferred← citeshttps://doi.org/10.1109/icvris51417.2020.00011openalex-snapshot
Automated Course Arrangement Based on Simulated Annealing Technique
inferred← citeshttps://doi.org/10.1109/iit.2007.4430422openalex-snapshot
Finding Feasible Timetables with Particle Swarm Optimization
inferred← citeshttps://doi.org/10.1109/itsim.2010.5561545openalex-snapshot
Average late acceptance randomized descent algorithm for solving course timetabling problems
inferred← citeshttps://doi.org/10.1109/jiot.2019.2902410openalex-snapshot
Experiences With IoT and AI in a Smart Campus for Optimizing Classroom Usage
inferred← citeshttps://doi.org/10.1109/kse.2010.31openalex-snapshot
Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem
inferred← citeshttps://doi.org/10.1109/nabic.2010.5716340openalex-snapshot
An evolutionary algorithm hyper-heuristic for producing feasible timetables for the curriculum based university course timetabling problem
inferred← citeshttps://doi.org/10.1109/nnice61279.2024.10498409openalex-snapshot
A Study of Multi-Week Scheduling Scheme Based on Integer Programming
inferred← citeshttps://doi.org/10.1109/scis.2007.367686openalex-snapshot
Memory Length in Hyper-heuristics: An Empirical Study
inferred← citeshttps://doi.org/10.1109/tevc.2006.885162openalex-snapshot
Finding Feasible Timetables Using Group-Based Operators
inferred← citeshttps://doi.org/10.1145/1543834.1543885openalex-snapshot
A simulated annealing algorithm with a new neighborhood structure for the timetabling problem
inferred← citeshttps://doi.org/10.1145/3436829.3436873openalex-snapshot
Smart University Scheduling Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0320openalex-snapshot
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
inferred← citeshttps://doi.org/10.13189/csit.2013.010307openalex-snapshot
Using Simulated Annealing and Ant-Colony Optimization Algorithms to Solve the Scheduling Problem
inferred← citeshttps://doi.org/10.21203/rs.3.rs-2511227/v1openalex-snapshot
Exam Room Timetabling Using MIP and SMAC
inferred← citeshttps://doi.org/10.26190/unsworks/22576openalex-snapshot
Modelling and Optimisation of Resource Usage in an IoT Enabled Smart Campus
inferred← citeshttps://doi.org/10.37934/araset.32.1.120138openalex-snapshot
Smart Campus 4.0: Digitalization of University Campus with Assimilation of Industry 4.0 for Innovation and Sustainability
inferred← citeshttps://doi.org/10.3934/naco.2014.4.269openalex-snapshot
Computational models for timetabling problem
inferred← citeshttps://doi.org/10.5120/20077-2100openalex-snapshot
Genetically Evolved Solution to Timetable Scheduling Problem
inferred← citeshttps://doi.org/10.5120/9742-4293openalex-snapshot
A New Biological Operator in Genetic Algorithm for Class Scheduling Problem
inferred← citeshttps://doi.org/10.70675/01a5c7c9za76ez4098zad13z6bd9d182ffc4openalex-snapshot
Planification et optimisation de ressources pour la formation en santé
inferred← citeshttps://doi.org/10.70675/2aa4b127zfdabz4823zb833z3eb4a54505fcopenalex-snapshot
Mathematical models and methods based on metaheuristic approach for timetabling problem
inferred← citeshttps://doi.org/10.70675/e05926e7zf516z400bz91f4zad351293cbedopenalex-snapshot
Modeling and solving university timetabling
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.