School Timetabling—A Case in Large Binary Integer Linear Programming
From MaRDI portal
Publication:3217921
DOI10.1287/mnsc.30.12.1473zbMath0554.90058OpenAlexW2045837509MaRDI QIDQ3217921
Publication date: 1984
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.30.12.1473
Lagrangean relaxationbranch and boundtimetablingcomputational resultssubgradient optimizationlarge integer linear programming
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items
The consultation timetabling problem at Danish high schools ⋮ A tabu search algorithm for computing an operational timetable ⋮ A computational approach to enhancing course timetabling with integer programming ⋮ A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems ⋮ Efficient solutions for a university timetabling problem through integer programming ⋮ Variable neighborhood search based algorithms for high school timetabling ⋮ Mathematical models and algorithms for a high school timetabling problem ⋮ A large scale timetabling problem ⋮ A computational study of a cutting plane algorithm for university course timetabling ⋮ Elective course planning ⋮ A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem. ⋮ An integer programming formulation for a case study in university timetabling. ⋮ Curriculum-based course timetabling with student flow, soft constraints, and smoothing objectives: an application to a real case study ⋮ On the calculation of true and pseudo penalties in multiple choice integer programming ⋮ Modelling and solving an acyclic multi-period timetabling problem ⋮ Computerised decision aid for timetabling --- a case analysis ⋮ A survey of metaheuristic-based techniques for university timetabling problems ⋮ A university-timetabling problem and its solution using Benders' partitioning---a case study ⋮ A branch-and-cut procedure for the Udine course timetabling problem ⋮ Term-end exam scheduling at United States Military Academy/West Point ⋮ Computational comparison on the partitioning strategies in multiple choice integer programming ⋮ Decomposition, reformulation, and diving in university course timetabling ⋮ The course scheduling problem at Lufthansa technical training ⋮ Modeling and solving a real-life assignment problem at universities ⋮ An integer program and a hybrid genetic algorithm for the university timetabling problem ⋮ A column generation mathematical programming approach for a class-faculty assignment problem with preferences
