USING INTEGER LINEAR PROGRAMMING FOR DISCRETE PROBLEM OPTIMIZATION

被引：0

作者：

Sklenar, Jaroslav ^{[1
]}

Cutajar, Valerie ^{[1
]}

Ceska, Milan ^{[2
]}

机构：

[1] Univ Malta, Dept Stat & Operat Res, Msida 2080, Msd, Malta

[2] Brno Univ Technol, Fac Informat Technol, Dept Intelligent Syst, Brno 60200, Czech Republic

来源：

EUROPEAN SIMULATION AND MODELLING CONFERENCE 2008 | 2008年

关键词：

Discrete optimization; Integer programming; Petri nets;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We present an application of integer programming that generates optimal examination timetables. The model is based on common assignment problem constraints together with more advanced logical constraints and penalty-based relaxations. In order to minimize the number of constraints we identify dense timetables where the main objective is elimination of clashes and sparse timetables where we spread the exams as evenly as possible. We also mention the possibility of using Petri and related nets to solve this problem.

引用

页码：19 / +

页数：2

共 7 条

[1] Recent research directions in automated timetabling
Burke, EK
Petrovic, S
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 140 (02) : 266 - 280
[2] Examination timetabling: Algorithmic strategies and applications
Carter, MW
Laporte, G
Lee, SY
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (03) : 373 - 383
[3] Verification of bounded Petri nets using integer programming
Khomenko, Victor
Koutny, Maciej
[J]. FORMAL METHODS IN SYSTEM DESIGN, 2007, 30 (02) : 143 - 176
[4] MELZER S, 1996, PROGRAMMING LANGUAGE, V96, P250
[5] Sierksma G., 1996, LINEAR INTEGER PROGR
[6] Williams H. P., 1999, MODEL BUILDING MATH
[7] Wolsey L. A., 1999, WIL INT S D

← 1 →