Pages that link to "Item:Q3990560"
From MaRDI portal
The following pages link to When Is the Classroom Assignment Problem Hard? (Q3990560):
Displaying 25 items.
- A complexity analysis and an algorithmic approach to student sectioning in existing timetables (Q310342) (← links)
- Operational research in education (Q319179) (← links)
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom (Q342113) (← links)
- A survey of school timetabling research (Q475201) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- An assignment problem and its application in education domain: a review and potential path (Q721078) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Comparison of neural and heuristic methods for a timetabling problem (Q1268158) (← links)
- The teacher assignment problem: A special case of the fixed charge transportation problem (Q1278981) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Scheduling classes on a college campus (Q1588834) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Resource assignment in high school timetabling (Q1761904) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- A multi-stage IP-based heuristic for class timetabling and trainer rostering (Q2398428) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- Interval scheduling on identical machines (Q2564884) (← links)
- A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM (Q3585099) (← links)
- Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades (Q6554626) (← links)
