Katalog GES



Academic course scheduling under workload and changeover constraints

1st Person: Drexl, Andreas
Additional Persons: Juretzka, Jan; Salewski, Frank
Type of Publication: Paper
Language: English
Published: Universität Kiel, Institut für Betriebswirtschaftslehre 1993
Series: Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
Keywords: Studium
Mathematische Optimierung
Theorie
University education
Mathematical programming
Theory
Online: http://hdl.handle.net/10419/155413
id
oai_econstor.eu_10419-155413
recordtype
econstor
institution
MPG
collection
ECONSTOR
title
Academic course scheduling under workload and changeover constraints
spellingShingle
Academic course scheduling under workload and changeover constraints
Studium
Mathematische Optimierung
Theorie
University education
Mathematical programming
Theory
Drexl, Andreas
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
title_short
Academic course scheduling under workload and changeover constraints
title_full
Academic course scheduling under workload and changeover constraints
title_fullStr
Academic course scheduling under workload and changeover constraints
title_full_unstemmed
Academic course scheduling under workload and changeover constraints
title_sort
Academic course scheduling under workload and changeover constraints
format
electronic Article
format_phy_str_mv
Paper
publisher
Universität Kiel, Institut für Betriebswirtschaftslehre
publishDate
1993
language
English
topic
Studium
Mathematische Optimierung
Theorie
University education
Mathematical programming
Theory
topic_facet
University education
Mathematical programming
Theory
author
Drexl, Andreas
author2
Juretzka, Jan
Salewski, Frank
author2Str
Juretzka, Jan
Salewski, Frank
description
Two phases can be distinguished in academic course scheduling: In phase one lectures have to be assigned to professors, whereas in phase two the lectures have to be scheduled. Here we assume that the lectures are already assigned to professors, i.e. the first phase has been done. For the second phase we look for a schedule of lectures (for one week) in such a way that several restrictions (availability of professors and students; workloads per day; changeover times; etc.) are observed. The problem under consideration is represented as a binary optimization model, where we make use of a new type of resources, i.e. so-called partially renewable resources. It is shown that even the feasibility version of the problem is NP-complete. We present heuristics which are essentially based on three ideas: First, prevent blocking of lectures, rooms and/or time-slots; second, look at the worst-case consequence of local decisions; third, perform regret based biased random sampling. We provide an instance generator for the generation of a representative set of instances. The generator along with a statistical model are used for a thorough experimental evaluation of the methods. Computational results show that the methods solve medium-sized instances to suboptimality.
url
http://hdl.handle.net/10419/155413
series
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
seriesStr
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
series2
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
series2_facet
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel
up_date
2019-02-15T03:50:14.718Z
_version_
1625505288666742787

Similar Items

Cannot find similar records

Library Services

Search Options

Quick links

Orientation