Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
type: Item
instance of: scholarly article
title: Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
zbMATH Open document ID: 1434.90055
author: Gülcin Ermis
author: Can Akkan
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 7032709
zbMATH Keywords: timetabling
zbMATH Keywords: matheuristics
zbMATH Keywords: local search
zbMATH Keywords: robustness
zbMATH Keywords: bi-criteria optimization
describes a project that uses: CPLEX
describes a project that uses: MOEA/D
describes a project that uses: HypE
MaRDI profile type: Publication
full work available at URL: s10479-017-2646-5
OpenAlex ID: W2765899991
cites work: Finding robust timetables for project presentations of student teams
cites work: A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty
cites work: A Pareto-based search methodology for multi-objective nurse scheduling
cites work: A short-turning policy for the management of demand disruptions in rapid transit systems
cites work: A multi-stage IP-based heuristic for class timetabling and trainer rostering
cites work: A variable neighborhood search based matheuristic for nurse rostering problems
cites work: Flight gate scheduling with respect to a reference schedule
cites work: A fix-and-optimize heuristic for the high school timetabling problem
cites work: Q3833646
cites work: On operators and search space topology in multi-objective flow shop scheduling
cites work: An overview of population-based algorithms for multi-objective optimisation
cites work: Q4692508
cites work: A robust approach for the single machine scheduling problem
cites work: Adaptive large neighborhood search for the curriculum-based course timetabling problem
cites work: Matheuristics
cites work: A multiobjective framework for heavily constrained examination timetabling problems
cites work: Solving the multi-objective nurse scheduling problem with a weighted cost function
cites work: A comparison of two approaches to nurse rostering problems
cites work: Variants of simulated annealing for the examination timetabling problem
cites work: An IP-based heuristic for the post enrolment course timetabling problem of the ITC2007
cites work: The design and implementation of an interactive course-timetabling system
DOI: 10.1007/S10479-017-2646-5
Recommended article: A Bicriteria Approach for Robust Timetabling
Recommended article: An empirical analysis of robustness concepts for timetabling
Recommended article: A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems
Recommended article: Q3054639
Recommended article: Búsqueda tabú con criterio de aspiración probabilístico aplicada a la generación de horarios escolares
Recommended article: Q4350044
Recommended article: Robust scheduling and robustness measures for the discrete time/cost trade-off problem
description: scientific article; zbMATH DE number 7032709