An introduction to timetabling
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3491001 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- scientific article; zbMATH DE number 3230852 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- A Lagrangean Relaxation Approach to Course Timetabling
- A Note on Faculty Timetabling
- A classroom/time assignment model
- A graph coloring algorithm for large scheduling problems
- A new graph colouring algorithm
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Chromatic Scheduling and the Chromatic Number Problem
- Chromatic optimisation: Limitations, objectives, uses, references
- Continuous Timetabling Problems
- Four classes of perfectly orderable graphs
- New methods to color the vertices of a graph
- On the Complexity of Timetable and Multicommodity Flow Problems
- School Timetables
- Some Comments On A Note About Timetabling*
- Zurückführung des Stundenplanproblems auf ein dreidimensionales Transportproblem
Cited in
(only showing first 100 items - show all)- A logic approach to the resolution of constraints in timetabling
- The minimum chromatic violation problem: a polyhedral approach
- A new ant colony optimization algorithm for the lower bound of sum coloring problem
- On a conjecture for the university timetabling problem
- Adaptive large neighborhood search for the curriculum-based course timetabling problem
- Practices in timetabling in higher education institutions: a systematic review
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- Comparison of neural and heuristic methods for a timetabling problem
- The maximum-impact coloring polytope
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm
- A note on SS/TDMA satellite communication
- On the complexity of nurse rostering problems
- Connected greedy coloring of \(H\)-free graphs
- Mutual exclusion scheduling with interval graphs or related classes. II
- An adaptive, multiple restarts neural network algorithm for graph coloring
- Facet-generating procedures for the maximum-impact coloring polytope
- Facet-generating procedures for the maximum-impact coloring polytope
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy
- A new approach to the vertex coloring problem
- Graph theory applied in school schedule network
- Multiprofessor scheduling
- Chromatic scheduling and frequency assignment
- Combinatorial optimization in system configuration design
- Iterative coloring extension of a maximum clique
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro
- An approximation scheme for bin packing with conflicts
- Modelling and solving an acyclic multi-period timetabling problem
- Modeling and solving a real-life assignment problem at universities
- An adaptive flex-deluge approach to university exam timetabling
- A generalized class-teacher model for some timetabling problems
- A timetabling system for scheduling courses of statistics and data science: methodology and case study
- A multi-stage IP-based heuristic for class timetabling and trainer rostering
- Preassignment requirements in chromatic scheduling
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study
- On the \(b\)-continuity of the lexicographic product of graphs
- Simple decentralized graph coloring
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- An effective hybrid local search approach for the post enrolment course timetabling problem
- Graphs with small fall-spectrum
- Pre-processing techniques for resource allocation in the heterogeneous case
- An integer program and a hybrid genetic algorithm for the university timetabling problem
- COSINE: A new graph coloring algorithm
- An interactive system for constructing timetables on a PC
- CHECKCOL: improved local search for graph coloring
- A matheuristic for customized multi-level multi-criteria university timetabling
- A goal programming model for timetable scheduling
- Flow in network modeling time tabling and scheduling problem
- Object-oriented constraint logic programming for timetable planning
- Timetable planning using the constraint-based reasoning
- Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences
- Classroom note. Contributions of graphs to staff rostering
- Profit margin oriented course scheduling at Lufthansa Technical Training Ltd.
- Solving vertex coloring problems as maximum weight stable set problems
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Tabu search for large scale timetabling problems
- Efficient solutions for a university timetabling problem through integer programming
- A computational study of local search algorithms for Italian high-school timetabling
- An integer programming formulation for a case study in university timetabling.
- A greedy-based neighborhood search approach to a nurse rostering problem.
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling
- Using mixed graph coloring to minimize total completion time in job shop scheduling
- On a multiconstrained model for chromatic scheduling
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete
- An exact method for graph coloring
- A two-stage decomposition of high school timetabling applied to cases in Denmark
- A survey on vertex coloring problems
- Scheduling sports competitions on multiple venues.
- A survey of search methodologies and automated system development for examination timetabling
- Mathematical programming models and algorithms for a class--faculty assignment problem
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application
- A decomposed metaheuristic approach for a real-world university timetabling problem
- Distribution requirements and compactness constraints in school timetabling
- School timetabling for quality student and teacher schedules
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling
- Elective course planning
- Cyclic transfers in school timetabling
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Improved local search approaches to solve the post enrolment course timetabling problem
- Constructing a course schedule by solving a series of assignment type problems
- Exploring the role of graph spectra in graph coloring algorithm performance
- An exact approach for the vertex coloring problem
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Some experiments with simulated annealing for coloring graphs
- A search space ``cartography for guiding graph coloring heuristics
- Finding a feasible course schedule using Tabu search
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems
- A multi-objective evolutionary algorithm for examination timetabling
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
- A cellular memetic algorithm for the examination timetabling problem
- Application of a real-world university-course timetabling model solved by integer programming
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- Penalising patterns in timetables: novel integer programming formulations
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution
- Local search and constraint programming for the post enrolment-based course timetabling problem
- Measuring instance difficulty for combinatorial optimization problems
- A tabu search algorithm for computing an operational timetable
This page was built for publication: An introduction to timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759645)
