About: Penalising Patterns in Timetables: Novel Integer Programming Formulations     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Many complex timetabling problems, such as university course timetabling and employee rostering, have an underpinning graph colouring component, a pattern penalisation component and a number of side constraints. In real-life settings, it might be relatively easy to come up with feasible solutions to instances of graph colouring, which correspond to hard constraints such as ``each student attends all events of courses of his choice and no student can be in two rooms at the same time'' even for hundreds of events and hundreds of distinct enrollments. Much more challenging are requirements such as ``students should not have gaps in their individual daily timetables'', which often make the problem over-constrained. On the example of the Udine Course Timetabling Problem, this paper studies several integer programming formulations of such pattern penalising constraints.
  • Many complex timetabling problems, such as university course timetabling and employee rostering, have an underpinning graph colouring component, a pattern penalisation component and a number of side constraints. In real-life settings, it might be relatively easy to come up with feasible solutions to instances of graph colouring, which correspond to hard constraints such as ``each student attends all events of courses of his choice and no student can be in two rooms at the same time'' even for hundreds of events and hundreds of distinct enrollments. Much more challenging are requirements such as ``students should not have gaps in their individual daily timetables'', which often make the problem over-constrained. On the example of the Udine Course Timetabling Problem, this paper studies several integer programming formulations of such pattern penalising constraints. (en)
Title
  • Penalising Patterns in Timetables: Novel Integer Programming Formulations
  • Penalising Patterns in Timetables: Novel Integer Programming Formulations (en)
skos:prefLabel
  • Penalising Patterns in Timetables: Novel Integer Programming Formulations
  • Penalising Patterns in Timetables: Novel Integer Programming Formulations (en)
skos:notation
  • RIV/00216224:14330/08:00025638!RIV10-MSM-14330___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 386189
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14330/08:00025638
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • integer programming; course timetabling; patterns (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [269D53C521EE]
http://linked.open...v/mistoKonaniAkce
  • Berlin
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • Operations Research Proceedings 2007
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Rudová, Hana
  • Mareček, Jakub
  • Burke, Edmund K.
  • Parkes, Andrew J.
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000264978100063
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 0721-5924
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-77902-5
http://localhost/t...ganizacniJednotka
  • 14330
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software