Scheduling examinations to reduce second-order conflicts

DOI10.1016/0305-0548(92)90066-EzbMath0825.90530MaRDI QIDQ1200827

Abilio Lucena, Nagraj Balakrishnan, Richard T. Wong

Publication date: 16 January 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A multi-objective evolutionary algorithm for examination timetabling ⋮ Operational research in education ⋮ Variants of simulated annealing for the examination timetabling problem ⋮ Planning of high school examinations in Denmark ⋮ A constructive approach to examination timetabling based on adaptive decomposition and ordering ⋮ Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ An improved multi-staged algorithmic process for~the~solution of the examination timetabling problem ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ Distribution requirements and compactness constraints in school timetabling ⋮ Recent research directions in automated timetabling

Cites Work

• State-space relaxation procedures for the computation of bounds to routing problems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Time‐dependent traveling salesman problem–the deliveryman case