A survey of automated timetabling:
Abstract: "The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literatur...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,67 |
| Subjects: | |
| Summary: | Abstract: "The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or high school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to artificial intelligence (e.g. genetic algorithms, tabu search, simulated annealing, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution." |
| Physical Description: | 33 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011064957 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)35649319 | ||
| 035 | |a (DE-599)BVBBV011064957 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Schaerf, Andrea |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A survey of automated timetabling |c A. Schaerf |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 33 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 95,67 | |
| 520 | 3 | |a Abstract: "The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or high school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to artificial intelligence (e.g. genetic algorithms, tabu search, simulated annealing, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution." | |
| 650 | 4 | |a Combinatorial optimization | |
| 650 | 4 | |a Heuristic | |
| 650 | 4 | |a Production scheduling | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,67 |w (DE-604)BV008928356 |9 95,67 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410844 | ||
Record in the Search Index
| _version_ | 1804125554110103552 |
|---|---|
| any_adam_object | |
| author | Schaerf, Andrea |
| author_facet | Schaerf, Andrea |
| author_role | aut |
| author_sort | Schaerf, Andrea |
| author_variant | a s as |
| building | Verbundindex |
| bvnumber | BV011064957 |
| ctrlnum | (OCoLC)35649319 (DE-599)BVBBV011064957 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01798nam a2200301 cb4500</leader><controlfield tag="001">BV011064957</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35649319</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011064957</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schaerf, Andrea</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A survey of automated timetabling</subfield><subfield code="c">A. Schaerf</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">33 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">95,67</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or high school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to artificial intelligence (e.g. genetic algorithms, tabu search, simulated annealing, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Heuristic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production scheduling</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">95,67</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,67</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410844</subfield></datafield></record></collection> |
| id | DE-604.BV011064957 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410844 |
| oclc_num | 35649319 |
| open_access_boolean | |
| physical | 33 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Schaerf, Andrea Verfasser aut A survey of automated timetabling A. Schaerf Amsterdam 1995 33 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,67 Abstract: "The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or high school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to artificial intelligence (e.g. genetic algorithms, tabu search, simulated annealing, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution." Combinatorial optimization Heuristic Production scheduling Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,67 (DE-604)BV008928356 95,67 |
| spellingShingle | Schaerf, Andrea A survey of automated timetabling Combinatorial optimization Heuristic Production scheduling |
| title | A survey of automated timetabling |
| title_auth | A survey of automated timetabling |
| title_exact_search | A survey of automated timetabling |
| title_full | A survey of automated timetabling A. Schaerf |
| title_fullStr | A survey of automated timetabling A. Schaerf |
| title_full_unstemmed | A survey of automated timetabling A. Schaerf |
| title_short | A survey of automated timetabling |
| title_sort | a survey of automated timetabling |
| topic | Combinatorial optimization Heuristic Production scheduling |
| topic_facet | Combinatorial optimization Heuristic Production scheduling |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT schaerfandrea asurveyofautomatedtimetabling |