School Timetabling--A Case in Large Binary Integer Linear Programming

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of special...

Full description

Saved in:
Bibliographic Details
Published inManagement science Vol. 30; no. 12; pp. 1473 - 1489
Main Author Tripathy, Arabinda
Format Journal Article
LanguageEnglish
Published Linthicum, MD INFORMS 01.12.1984
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
SeriesManagement Science
Subjects
Algorithms
applications
Applied sciences
Exact sciences and technology
Groups
Heuristics
Integer programming
Integers
Integrality
Iterative solutions
Lagrangean relaxation
Linear programming
Management science
Mathematical models
Mathematical programming
Objective functions
Operational research and scientific management
Operational research. Management science
Optimization
Planning. Forecasting
programming: integer
Scheduling
Schools
Students
Transportation
Variable coefficients
Integer programming
Relaxation method
Linear programming
Planning
Mathematical programming
Online AccessGet full text

Cover

More Information
Summary:A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of special ordered sets of variables. We present computational results for a large timetabling problem involving 900 subjects in a one-year graduate program.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.30.12.1473