Search strategy for constraint-based class-teacher timetabling
Identifieur interne :
000192 ( PascalFrancis/Corpus );
précédent :
000191;
suivant :
000193
Search strategy for constraint-based class-teacher timetabling
Auteurs : Wojciech LegierskiSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0231716
Descripteurs français
English descriptors
Abstract
The paper deals with a scheduling problem: the computation of class-teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2740 |
|---|
| A08 | 01 | 1 | ENG | @1 Search strategy for constraint-based class-teacher timetabling |
|---|
| A09 | 01 | 1 | ENG | @1 PATAT 2002 : practice and theory of automated timetabling IV : Gent, 21-23 August 2002, selected revised papers |
|---|
| A11 | 01 | 1 | | @1 LEGIERSKI (Wojciech) |
|---|
| A12 | 01 | 1 | | @1 BURKE (Edmund) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 DE CAUSMAECKER (Patrick) @9 ed. |
|---|
| A14 | 01 | | | @1 Institute of Automatic Control, Silesian Technical University, Akademicka 16 @2 44-100 Gliwice @3 POL @Z 1 aut. |
|---|
| A20 | | | | @1 247-261 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-40699-9 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117783220160 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 17 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0231716 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 The paper deals with a scheduling problem: the computation of class-teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented. |
|---|
| C02 | 01 | X | | @0 001D01A12 |
|---|
| C03 | 01 | X | FRE | @0 Problème confection horaire @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Timetabling problem @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Problema concepción horario @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Programmation mathématique @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Mathematical programming @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Programación matemática @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Stratégie recherche @5 09 |
|---|
| C03 | 03 | X | ENG | @0 Search strategy @5 09 |
|---|
| C03 | 03 | X | SPA | @0 Estrategia investigación @5 09 |
|---|
| C03 | 04 | X | FRE | @0 Ordonnancement @5 10 |
|---|
| C03 | 04 | X | ENG | @0 Scheduling @5 10 |
|---|
| C03 | 04 | X | SPA | @0 Reglamento @5 10 |
|---|
| C03 | 05 | X | FRE | @0 Simultanéité informatique @5 11 |
|---|
| C03 | 05 | X | ENG | @0 Concurrency @5 11 |
|---|
| C03 | 05 | X | SPA | @0 Simultaneidad informatica @5 11 |
|---|
| C03 | 06 | X | FRE | @0 Abstraction @5 12 |
|---|
| C03 | 06 | X | ENG | @0 Abstraction @5 12 |
|---|
| C03 | 06 | X | SPA | @0 Abstracción @5 12 |
|---|
| C03 | 07 | X | FRE | @0 Optimisation @5 13 |
|---|
| C03 | 07 | X | ENG | @0 Optimization @5 13 |
|---|
| C03 | 07 | X | SPA | @0 Optimización @5 13 |
|---|
| C03 | 08 | X | FRE | @0 Implémentation @5 14 |
|---|
| C03 | 08 | X | ENG | @0 Implementation @5 14 |
|---|
| C03 | 08 | X | SPA | @0 Implementación @5 14 |
|---|
| C03 | 09 | X | FRE | @0 Recherche locale @4 CD @5 96 |
|---|
| C03 | 09 | X | ENG | @0 Local search @4 CD @5 96 |
|---|
| C03 | 09 | X | SPA | @0 Busca local @4 CD @5 96 |
|---|
| N21 | | | | @1 152 |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Practice and theory of automated timetabling. International conference @2 4 @3 Gent BEL @4 2002-08-21 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0231716 INIST |
|---|
| ET : | Search strategy for constraint-based class-teacher timetabling |
|---|
| AU : | LEGIERSKI (Wojciech); BURKE (Edmund); DE CAUSMAECKER (Patrick) |
|---|
| AF : | Institute of Automatic Control, Silesian Technical University, Akademicka 16/44-100 Gliwice/Pologne (1 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2740; Pp. 247-261; Bibl. 17 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | The paper deals with a scheduling problem: the computation of class-teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented. |
|---|
| CC : | 001D01A12 |
|---|
| FD : | Problème confection horaire; Programmation mathématique; Stratégie recherche; Ordonnancement; Simultanéité informatique; Abstraction; Optimisation; Implémentation; Recherche locale |
|---|
| ED : | Timetabling problem; Mathematical programming; Search strategy; Scheduling; Concurrency; Abstraction; Optimization; Implementation; Local search |
|---|
| SD : | Problema concepción horario; Programación matemática; Estrategia investigación; Reglamento; Simultaneidad informatica; Abstracción; Optimización; Implementación; Busca local |
|---|
| LO : | INIST-16343.354000117783220160 |
|---|
| ID : | 04-0231716 |
|---|
Links to Exploration step
Pascal:04-0231716
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Search strategy for constraint-based class-teacher timetabling</title>
<author><name sortKey="Legierski, Wojciech" sort="Legierski, Wojciech" uniqKey="Legierski W" first="Wojciech" last="Legierski">Wojciech Legierski</name>
<affiliation><inist:fA14 i1="01"><s1>Institute of Automatic Control, Silesian Technical University, Akademicka 16</s1>
<s2>44-100 Gliwice</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0231716</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0231716 INIST</idno>
<idno type="RBID">Pascal:04-0231716</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000192</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Search strategy for constraint-based class-teacher timetabling</title>
<author><name sortKey="Legierski, Wojciech" sort="Legierski, Wojciech" uniqKey="Legierski W" first="Wojciech" last="Legierski">Wojciech Legierski</name>
<affiliation><inist:fA14 i1="01"><s1>Institute of Automatic Control, Silesian Technical University, Akademicka 16</s1>
<s2>44-100 Gliwice</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Abstraction</term>
<term>Concurrency</term>
<term>Implementation</term>
<term>Local search</term>
<term>Mathematical programming</term>
<term>Optimization</term>
<term>Scheduling</term>
<term>Search strategy</term>
<term>Timetabling problem</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Problème confection horaire</term>
<term>Programmation mathématique</term>
<term>Stratégie recherche</term>
<term>Ordonnancement</term>
<term>Simultanéité informatique</term>
<term>Abstraction</term>
<term>Optimisation</term>
<term>Implémentation</term>
<term>Recherche locale</term>
</keywords><front><div type="abstract" xml:lang="en">The paper deals with a scheduling problem: the computation of class-teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2740</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Search strategy for constraint-based class-teacher timetabling</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>PATAT 2002 : practice and theory of automated timetabling IV : Gent, 21-23 August 2002, selected revised papers</s1>
</fA09><fA11 i1="01" i2="1"><s1>LEGIERSKI (Wojciech)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BURKE (Edmund)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>DE CAUSMAECKER (Patrick)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>Institute of Automatic Control, Silesian Technical University, Akademicka 16</s1>
<s2>44-100 Gliwice</s2>
<s3>POL</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>247-261</s1>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-40699-9</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117783220160</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>17 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0231716</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>The paper deals with a scheduling problem: the computation of class-teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D01A12</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Problème confection horaire</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Timetabling problem</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Problema concepción horario</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Programmation mathématique</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Mathematical programming</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Programación matemática</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Stratégie recherche</s0>
<s5>09</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Search strategy</s0>
<s5>09</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Estrategia investigación</s0>
<s5>09</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Ordonnancement</s0>
<s5>10</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Scheduling</s0>
<s5>10</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Reglamento</s0>
<s5>10</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Simultanéité informatique</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Concurrency</s0>
<s5>11</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Simultaneidad informatica</s0>
<s5>11</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Abstraction</s0>
<s5>12</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Abstraction</s0>
<s5>12</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Abstracción</s0>
<s5>12</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Optimisation</s0>
<s5>13</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Optimization</s0>
<s5>13</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Optimización</s0>
<s5>13</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Implémentation</s0>
<s5>14</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Implementation</s0>
<s5>14</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Implementación</s0>
<s5>14</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Recherche locale</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Local search</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Busca local</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>152</s1>
</fN21><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Practice and theory of automated timetabling. International conference</s1>
<s2>4</s2>
<s3>Gent BEL</s3>
<s4>2002-08-21</s4>
</fA30><server><NO>PASCAL 04-0231716 INIST</NO>
<ET>Search strategy for constraint-based class-teacher timetabling</ET>
<AU>LEGIERSKI (Wojciech); BURKE (Edmund); DE CAUSMAECKER (Patrick)</AU>
<AF>Institute of Automatic Control, Silesian Technical University, Akademicka 16/44-100 Gliwice/Pologne (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2740; Pp. 247-261; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>The paper deals with a scheduling problem: the computation of class-teacher timetables. Two cases are taken into consideration: high school problems and university department problems. The timetable was constructed using constraint programming techniques. The timetabling needs to take into account a variety of complex constraints and use special-purpose search strategies. The concurrent constraint language Mozart/Oz was used, which provides high-level abstraction, and allows the expression of complex constraints and the creation of a complicated, custom-tailored distribution strategy. This strategy, consisting of six stages, was crucial for finding a feasible solution. The space-based search allows the incorporation of local search into constraint programming; this is very useful for timetable optimization. Technical details and results of the implementation are presented.</EA>
<CC>001D01A12</CC>
<FD>Problème confection horaire; Programmation mathématique; Stratégie recherche; Ordonnancement; Simultanéité informatique; Abstraction; Optimisation; Implémentation; Recherche locale</FD>
<ED>Timetabling problem; Mathematical programming; Search strategy; Scheduling; Concurrency; Abstraction; Optimization; Implementation; Local search</ED>
<SD>Problema concepción horario; Programación matemática; Estrategia investigación; Reglamento; Simultaneidad informatica; Abstracción; Optimización; Implementación; Busca local</SD>
<LO>INIST-16343.354000117783220160</LO>
<ID>04-0231716</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000192 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000192 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0231716
|texte= Search strategy for constraint-based class-teacher timetabling
}}
| This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023 |  |
