Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahuja, R.K., Ergun, Ö., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75–102 (2002)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs, NJ (1993)
Bartholdi, J.J, McCroan, K.L.: Scheduling interviews for a job fair. Operations Research 38, 951–960 (1990)
Dowsland, K.A.: Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research 106, 393–407 (1998)
Giaro, K., Kubale, M.: Compact scheduling of zero-one time operations in multi-stage system. Discrete and Applied Mathematics 145, 95–103 (2004)
Gonzalez, T.: Unit execution time shop problems. Mathematics of Operations Research 7, 57–66 (1982)
Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. Journal of the ACM 23, 665–679 (1976)
Hall, N.G., Sriskandarajah, C.: A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44, 510–525 (1996)
Meyers, C., Orlin, J.B.: Very large-scale neighborhood search techniques in timetabling problems. In: Burke, E.K., Rudová, H. (eds.) PATAT 2006. LNCS, vol. 3867, pp. 24–39. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rinaldi, F., Serafini, P. (2007). Scheduling School Meetings. In: Burke, E.K., Rudová, H. (eds) Practice and Theory of Automated Timetabling VI. PATAT 2006. Lecture Notes in Computer Science, vol 3867. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77345-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-77345-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77344-3
Online ISBN: 978-3-540-77345-0
eBook Packages: Computer ScienceComputer Science (R0)