Random partial neighborhood search for the post-enrollment course timetabling problem
type: Item
instance of: scholarly article
title: Random partial neighborhood search for the post-enrollment course timetabling problem
zbMATH Open document ID: 1391.90295
author: Yuichi Nagata
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6901531
zbMATH Keywords: candidate list
zbMATH Keywords: partial neighborhood
zbMATH Keywords: tabu search
zbMATH Keywords: timetabling
describes a project that uses: Tabu search
describes a project that uses: Hyperheuristics
MaRDI profile type: Publication
full work available at URL: j.cor.2017.09.014
OpenAlex ID: W2755616334
cites work: A time-predefined approach to course timetabling
cites work: A graph-based hyper-heuristic for educational timetabling problems
cites work: Local search and constraint programming for the post enrolment-based course timetabling problem
cites work: An effective hybrid algorithm for university course timetabling
cites work: Neighborhood portfolio approach for local search applied to timetabling problems
cites work: A survey of metaheuristic-based techniques for university timetabling problems
cites work: A time-dependent metaheuristic algorithm for post enrolment-based course timetabling
cites work: ITC2007 solver description: a hybrid approach
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Solving the post enrolment course timetabling problem by ant colony optimization
cites work: Effective learning hyper-heuristics for the course timetabling problem
DOI: 10.1016/J.COR.2017.09.014
description: scientific article; zbMATH DE number 6901531