An Algorithm for Constructing a New School Timetable from a Previous School Timetable

Hisashi MINE; Katsuhisa OHNO; Isao MIYAJI

An Algorithm for Constructing a New School Timetable from a Previous School Timetable

Hisashi MINE, Katsuhisa OHNO, Isao MIYAJI

Full Text Views

0

Cite this

Summary :

This paper proposes a heuristic algorithm for constructing a new school timetable by revising partially the school timetable already constructed for the previous year. This algorithm is considered as an extension of the algorithm proposed in the author's previous paper which aims at constructing a new school timetable. It is noted that the assignments in the present algorithm begin with an almost filled school timetable, while the assignments in the previous algorithm begin with an almost empty school timetable. Numerical examples show that the computation time of the present algorithm is considerably shorter than that of the previous algorithm when a timetable for the previous year is available.

Publication: IEICE TRANSACTIONS on transactions Vol.E62-E No.4 pp.229-234

Publication Date: 1979/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Data Processing

Authors

Hisashi MINE
Katsuhisa OHNO
Isao MIYAJI

Keyword

Cite this

Copy

Hisashi MINE, Katsuhisa OHNO, Isao MIYAJI, "An Algorithm for Constructing a New School Timetable from a Previous School Timetable" in IEICE TRANSACTIONS on transactions, vol. E62-E, no. 4, pp. 229-234, April 1979, doi: .
Abstract: This paper proposes a heuristic algorithm for constructing a new school timetable by revising partially the school timetable already constructed for the previous year. This algorithm is considered as an extension of the algorithm proposed in the author's previous paper which aims at constructing a new school timetable. It is noted that the assignments in the present algorithm begin with an almost filled school timetable, while the assignments in the previous algorithm begin with an almost empty school timetable. Numerical examples show that the computation time of the present algorithm is considerably shorter than that of the previous algorithm when a timetable for the previous year is available.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e62-e_4_229/_p

Copy

@ARTICLE{e62-e_4_229,
author={Hisashi MINE, Katsuhisa OHNO, Isao MIYAJI, },
journal={IEICE TRANSACTIONS on transactions},
title={An Algorithm for Constructing a New School Timetable from a Previous School Timetable},
year={1979},
volume={E62-E},
number={4},
pages={229-234},
abstract={This paper proposes a heuristic algorithm for constructing a new school timetable by revising partially the school timetable already constructed for the previous year. This algorithm is considered as an extension of the algorithm proposed in the author's previous paper which aims at constructing a new school timetable. It is noted that the assignments in the present algorithm begin with an almost filled school timetable, while the assignments in the previous algorithm begin with an almost empty school timetable. Numerical examples show that the computation time of the present algorithm is considerably shorter than that of the previous algorithm when a timetable for the previous year is available.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - An Algorithm for Constructing a New School Timetable from a Previous School Timetable
T2 - IEICE TRANSACTIONS on transactions
SP - 229
EP - 234
AU - Hisashi MINE
AU - Katsuhisa OHNO
AU - Isao MIYAJI
PY - 1979
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E62-E
IS - 4
JA - IEICE TRANSACTIONS on transactions
Y1 - April 1979
AB - This paper proposes a heuristic algorithm for constructing a new school timetable by revising partially the school timetable already constructed for the previous year. This algorithm is considered as an extension of the algorithm proposed in the author's previous paper which aims at constructing a new school timetable. It is noted that the assignments in the present algorithm begin with an almost filled school timetable, while the assignments in the previous algorithm begin with an almost empty school timetable. Numerical examples show that the computation time of the present algorithm is considerably shorter than that of the previous algorithm when a timetable for the previous year is available.
ER -