Pages that link to "Item:Q1848400"

The following pages link to A generalized class-teacher model for some timetabling problems (Q1848400):

Displaying 33 items.

• A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
• Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
• Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
• School timetabling for quality student and teacher schedules (Q842557) (← links)
• A heuristic approach to simultaneous course/student timetabling (Q856666) (← links)
• A mixed-integer programming approach to a class timetabling problem: a case study with gender policies and traffic considerations (Q872118) (← links)
• A computational study of local search algorithms for Italian high-school timetabling (Q930154) (← links)
• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups (Q969520) (← links)
• Application of a real-world university-course timetabling model solved by integer programming (Q1018245) (← links)
• Disjoint congruence classes and a timetabling application (Q1026128) (← links)
• Polynomial reduction of time-space scheduling to time scheduling (Q1028105) (← links)
• Condensing timetables with target date divisible by each instructor's number of class hours (Q1033890) (← links)
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
• Timetabling problem for university as assignment of activities to resources (Q1086142) (← links)
• The combinatorics of timetabling (Q1278524) (← links)
• The teacher assignment problem: A special case of the fixed charge transportation problem (Q1278981) (← links)
• Scheduling classes on a college campus (Q1588834) (← links)
• Multiprofessor scheduling (Q1686063) (← links)
• Optimal student sectioning on mandatory courses with various sections numbers (Q1730755) (← links)
• Strong bounds with cut and column generation for class-teacher timetabling (Q1761917) (← links)
• Hybrid heuristics for examination timetabling problem (Q1774877) (← links)
• Comparison of metaheuristic algorithms for examination timetabling problem (Q1885092) (← links)
• Time-tables, polyhedra and the greedy algorithm (Q1917272) (← links)
• On a conjecture for the university timetabling problem (Q2028068) (← links)
• Decomposition of university course timetabling. A systematic study of subproblems and their complexities (Q2241151) (← links)
• A particular timetable problem: Terminal scheduling (Q2276867) (← links)
• A column generation mathematical programming approach for a class-faculty assignment problem with preferences (Q2355201) (← links)
• A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
• Mathematical programming models and algorithms for a class--faculty assignment problem (Q2496072) (← links)
• (Q4692124) (← links)
• A continuous timetable with m, m – 2, or 2 instructor’s class hours (Q4917399) (← links)
• An adaptive large neighbourhood search metaheuristic for hourly learning activity planning in personalised learning (Q6109295) (← links)
• Multi-objective faculty course assignment problem based on the double parametric form of fuzzy preferences (Q6660140) (← links)