An existential problem of a weight- controlled subset and its application to school timetable construction

Kitagawa, Fumio; Ikeda, Hideto

doi:10.1016/0012-365x(88)90210-5

Cited by 33 publications

(9 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some papers have tried to generalize and unify the constraints (Chand 2004;Kitagawa and Ikeda 1988). Others have adapted existing technologies in which constraints may be expressed, such as XML and the semantic web (Custers et al 2005;De Causmaecker et al 2000;De Causmaecker et al 2002;Özcan 2005), or object-oriented modeling and frameworks (Gröbner et al 2003;Ranson and Ahmadi 2006).…”

Section: Introductionmentioning

confidence: 99%

An XML format for benchmarks in High School Timetabling

et al. 2010

View full text Add to dashboard Cite

The High School Timetabling Problem is amongst the most widely used timetabling problems. This problem has varying structures in different high schools even within the same country or educational system. Due to lack of standard benchmarks and data formats this problem has been studied less than other timetabling problems in the literature. In this paper we describe the High School Timetabling Problem in several countries in order to find a common set of constraints and objectives. Our main goal is to provide exchangeable benchmarks for this problem. To achieve this we propose a standard data format suitable for different countries and educational systems, defined by an XML schema. The schema and datasets are available online.

show abstract

Section: Introductionmentioning

confidence: 99%

An XML format for benchmarks in High School Timetabling

et al. 2010

View full text Add to dashboard Cite

show abstract

“…Examples are the mutual exclusion scheduling problem [6,71], scheduling in communication systems [33], construction timetables [46], and round-the-clock scheduling [74]. For other applications in scheduling, partitioning, and load balancing problems, one can look into [7,58,71].…”

Section: Equitable Coloringmentioning

confidence: 99%

Extremal graph packing problems: Ore-type versus Dirac-type

Kierstead¹,

Kostochka²,

Yu³

2009

Surveys in Combinatorics 2009

View full text Add to dashboard Cite

show abstract

“…Also the problems of this form have been studied in the operations research literature [3,23]. Other applications are in scheduling in communication systems [16] and in constructing school timetables [20].…”

Section: Introductionmentioning

confidence: 99%

Equitable colorings of bounded treewidth graphs

Bodlaender

Fomin

2005

Theoretical Computer Science

View full text Add to dashboard Cite

A proper coloring of a graph G is equitable if the sizes of any two color classes differ by at most one. A proper coloring is -bounded, when each color class has size at most . We consider the problems to determine for a given graph G (and a given integer ) whether G has an equitable ( -bounded) k-coloring. We prove that both problems can be solved in polynomial time on graphs of bounded treewidth, and show that a precolored version remains NP-complete on trees.

show abstract

An existential problem of a weight- controlled subset and its application to school timetable construction

Cited by 33 publications

References 14 publications

An XML format for benchmarks in High School Timetabling

An XML format for benchmarks in High School Timetabling

Extremal graph packing problems: Ore-type versus Dirac-type

Equitable colorings of bounded treewidth graphs

Contact Info

Product

Resources

About