A particular timetable problem: terminal scheduling

DOI10.1080/02331938708843221MaRDI QIDQ3766555zbMATH OpenOpenAlexFDO

Authors 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

alternating pathsheuristic algorithmHungarian methodminimal path algorithmoptimal time tableshortest path

Mathematics Subject Classification ID

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

Recommendations

• A particular timetable problem: Terminal scheduling
• scientific article; zbMATH DE number 4020833
• Scheduling to Minimize Maximum Workload
• An interactive system for constructing timetables on a PC
• Time-Tabling Problems: Should They Be Canonical?

Cites work

• A classroom/time assignment model
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms

Cited in

(5)

• A particular timetable problem: Terminal scheduling
• Balancing schedules using maximum leximin
• Scheduling to Minimize Maximum Workload
• scientific article; zbMATH DE number 4020833 (Why is no real title available?)
• Flow in network modeling time tabling and scheduling problem

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

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