Scheduling examinations to reduce second-order conflicts

DOI10.1016/0305-0548(92)90066-EMaRDI QIDQ1200827zbMATH OpenFDO

Authors Nagraj Balakrishnan, Abilio Lucena, 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)

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

Cited in

(11)

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

This page was built for publication: Scheduling examinations to reduce second-order conflicts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200827)