The following pages link to An introduction to timetabling (Q759645):
Displaying 50 items.
- On a multiconstrained model for chromatic scheduling (Q1293198) (← links)
- Pre-processing techniques for resource allocation in the heterogeneous case (Q1296109) (← links)
- Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← links)
- Modeling and solving a real-life assignment problem at universities (Q1303567) (← links)
- Chromatic scheduling and frequency assignment (Q1327228) (← links)
- A tabu search algorithm for computing an operational timetable (Q1331550) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- Profit margin oriented course scheduling at Lufthansa Technical Training Ltd. (Q1387946) (← links)
- A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481) (← links)
- A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. (Q1417487) (← links)
- An integer programming formulation for a case study in university timetabling. (Q1417497) (← links)
- Constraint programming approach for school timetabling. (Q1422351) (← links)
- Timetable planning using the constraint-based reasoning (Q1571031) (← links)
- Recent research directions in automated timetabling (Q1598761) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- A cellular memetic algorithm for the examination timetabling problem (Q1652614) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- On the \(b\)-continuity of the lexicographic product of graphs (Q1684933) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- An integer programming approach to curriculum-based examination timetabling (Q1686500) (← links)
- Graphs with small fall-spectrum (Q1720325) (← links)
- Practices in timetabling in higher education institutions: a systematic review (Q1730752) (← links)
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro (Q1748501) (← links)
- Improved local search approaches to solve the post enrolment course timetabling problem (Q1753553) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- Local search and constraint programming for the post enrolment-based course timetabling problem (Q1761894) (← links)
- Managing the tabu list length using a fuzzy inference system: an application to examination timetabling (Q1761914) (← links)
- An XML format for benchmarks in high school timetabling (Q1761916) (← links)
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts (Q1761944) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- A two-phase heuristic evolutionary algorithm for personalizing course timetables: a case study in a Spanish university (Q1777154) (← links)
- Scheduling sports competitions on multiple venues. (Q1810517) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
- Efficient solutions for a university timetabling problem through integer programming (Q1887870) (← links)
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- On a conjecture for the university timetabling problem (Q2028068) (← links)
- Obtaining quality business school examination timetable under heterogeneous elective selections through surrogacy (Q2085509) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study (Q2225651) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
- A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling (Q2460072) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
