Pages that link to "Item:Q1600003"
From MaRDI portal
The following pages link to Complexity of some special types of timetabling problems (Q1600003):
Displaying 12 items.
- 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)
- A new model for automated examination timetabling (Q1761908) (← 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)
