Pages that link to "Item:Q1600003"

The following pages link to Complexity of some special types of timetabling problems (Q1600003):

Displaying 21 items.

• A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
• Mathematical models and algorithms for a high school timetabling problem (Q337589) (← 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)
• School timetabling for quality student and teacher schedules (Q842557) (← links)
• A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← 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)
• A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems (Q1046051) (← links)
• An existential problem of a weight-controlled subset and its application to school timetable construction (Q1115806) (← links)
• The combinatorics of timetabling (Q1278524) (← links)
• Multiprofessor scheduling (Q1686063) (← links)
• A new model for automated examination timetabling (Q1761908) (← links)
• A generalized class-teacher model for some timetabling problems (Q1848400) (← links)
• Time-tables, polyhedra and the greedy algorithm (Q1917272) (← links)
• On a conjecture for the university timetabling problem (Q2028068) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• An effective hybrid local search approach for the post enrolment course timetabling problem (Q2656559) (← links)
• An application of edge coloring of graphs to a class scheduling problem (Q2749408) (← links)
• (Q2779820) (← links)
• About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622) (← links)