Formulación de un modelo basado en técnicas de optimización para la programación de horarios de clase en una institución educativa universitaria en la ciudad de Girardot

Abstract

Computer solution of timetabling, scheduling and rostering problems has been addressed in the literature since the 1950's. Early mathematical formulations proved impossible to solve given the limited computer power of the era. However, heuristics, often very specialised, were used for certain problems from a very early date, although the term heuristic was not generally recognised until later; a few guaranteed optimality, some consistently produced good solutions, but most became unwieldy when adjusted to deal with practical situations. In some cases, weaknesses in the heuristics were overcome by appeal to manual intervention. Mathematical approaches to some problems returned to favour, successfully, around 1980. Some of the subsequent developments of these are very powerful in practical situations, but they are no panacea, and metaheuristics are the flavour of the nineties. This paper explores the relationships between the problem types, and traces the above developments as applied principally in the areas of Vehicle Routeing and Scheduling, Driver Scheduling, Job Shop Scheduling and Personnel Rostering. Parallels are drawn with Class and Examination Timetabling, but these subjects themselves are not examined, as they are covered extensively elsewhere in this volume.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 41 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.