A particular timetable problem: terminal scheduling

DOI10.1080/02331938708843221zbMath0629.60010OpenAlexW2007559758MaRDI QIDQ3766555

András Sebő

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843221

zbMATH Keywords

shortest pathheuristic algorithmHungarian methodalternating pathsminimal path algorithmoptimal time table

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convergence of probability measures (60B10)

Cites Work

• Unnamed Item
• Unnamed Item
• A classroom/time assignment model
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms

This page was built for publication: A particular timetable problem: terminal scheduling