Scheduling interviews for a job fair
Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Compact scheduling of zero-one time operations in multi-stage systems
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
Very large-scale neighborhood search techniques in timetabling problems
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
A meeting scheduling problem respecting time and space
Geoinformatica
| Hi-index | 0.00 |
Prespecified meetings between teachers and parents have to be scheduled. All meetings have the same duration. The goal is in finding a schedule minimizing the total time and the parents' idle times. This NP-hard problem is addressed by solving first a sequence of weighted assignment problems and then performing a large scale neighborhood search based on finding negative cost cycles and shortest paths in directed graphs. This approach provides good computational results. Finally a variant of the problem with two different durations for the meetings is considered.