When Is the Classroom Assignment Problem Hard?
From MaRDI portal
Publication:3990560
DOI10.1287/opre.40.1.S28zbMath0745.90049OpenAlexW2024952061MaRDI QIDQ3990560
Michael W. Carter, Craig A. Tovey
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.40.1.s28
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Boolean programming (90C09)
Related Items
An analysis of shift class design problems, A complexity analysis and an algorithmic approach to student sectioning in existing timetables, Operational research in education, Increasing the revenue of self-storage warehouses by optimizing order scheduling, Integer programming methods for large-scale practical classroom assignment problems, Fixed interval scheduling: models, applications, computational complexity and algorithms, Inverse interval scheduling via reduction on a single machine, A multi-stage IP-based heuristic for class timetabling and trainer rostering, A survey of school timetabling research, Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem, On the computational complexity of (maximum) class scheduling, On the computational complexity of (maximum) shift class scheduling, License class design: Complexity and algorithms, Resource assignment in high school timetabling, A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM, An assignment problem and its application in education domain: a review and potential path, On the approximability of an interval scheduling problem, Comparison of neural and heuristic methods for a timetabling problem, Interval scheduling on identical machines, Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
