The following pages link to An introduction to timetabling (Q759645):
Displaying 50 items.
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Operational research in education (Q319179) (← links)
- New secure partial encryption method for medical images using graph coloring problem (Q330803) (← links)
- A two-stage decomposition of high school timetabling applied to cases in Denmark (Q336881) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Algorithms for the generalized weighted frequency assignment problem (Q339680) (← links)
- Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (Q342395) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Elective course planning (Q420895) (← links)
- Cyclic transfers in school timetabling (Q421072) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
- Preference-based assignment of university students to multiple teaching groups (Q480755) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← links)
- Some experiments with simulated annealing for coloring graphs (Q581241) (← links)
- Term-end exam scheduling at United States Military Academy/West Point (Q707689) (← links)
- Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete (Q730005) (← links)
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Tabu search for large scale timetabling problems (Q806794) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- A survey of search methodologies and automated system development for examination timetabling (Q835639) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- School timetabling for quality student and teacher schedules (Q842557) (← links)
- Assignment problems: a golden anniversary survey (Q852938) (← links)
- Using mixed graph coloring to minimize total completion time in job shop scheduling (Q858768) (← links)
- A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
- An effective hybrid algorithm for university course timetabling (Q880559) (← links)
- A note on SS/TDMA satellite communication (Q915633) (← links)
- A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
- Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem (Q954251) (← links)
- An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables (Q958431) (← links)
- The examination timetabling problem at Universiti Malaysia Pahang: comparison of a constructive heuristic with an existing software solution (Q992647) (← links)
- Application of a real-world university-course timetabling model solved by integer programming (Q1018245) (← links)
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems (Q1026761) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- An interactive system for constructing timetables on a PC (Q1117834) (← links)
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths (Q1179200) (← links)
- COSINE: A new graph coloring algorithm (Q1180823) (← links)
- Weighted graphs and university course timetabling (Q1185992) (← links)
- Modelling and solving an acyclic multi-period timetabling problem (Q1186307) (← links)
- Finding a feasible course schedule using Tabu search (Q1186313) (← links)
- A logic approach to the resolution of constraints in timetabling (Q1194718) (← links)
- A graph colouring model for assigning a heterogeneous workforce to a given schedule (Q1266545) (← links)
- An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
- Comparison of neural and heuristic methods for a timetabling problem (Q1268158) (← links)
- The combinatorics of timetabling (Q1278524) (← links)
- Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application (Q1291582) (← links)
- Distribution requirements and compactness constraints in school timetabling (Q1291590) (← links)
