{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:24:56Z","timestamp":1747578296792},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649793"},{"type":"electronic","value":"9783540498032"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055880","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T20:57:50Z","timestamp":1154033870000},"page":"37-52","source":"Crossref","is-referenced-by-count":24,"title":["Off-the-peg or made-to-measure? timetabling and scheduling with SA and TS"],"prefix":"10.1007","author":[{"given":"Kathryn A.","family":"Dowsland","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M. Lundy","year":"1986","unstructured":"Lundy, M. and Mees, A.: Convergence of an Annealing Algorithm. Mathematical Programming 34 (1986) 111\u2013124","journal-title":"Mathematical Programming"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01720782","volume":"11","author":"D. Werra De","year":"1989","unstructured":"De Werra, D. and Hertz, A.: Tabu Search Techniques \u2014 a Tutorial and Application to Neural Networks. OR Spektrum 11 (1989) 131\u2013141","journal-title":"OR Spektrum"},{"key":"3_CR3","unstructured":"Wren, A.: Scheduling, Timetabling and Rostering \u2014 a Special Relationship? In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 46\u201375"},{"key":"3_CR4","unstructured":"Robert, V., Hertz, A.: How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Sub-problems. In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 364\u2013373."},{"key":"3_CR5","unstructured":"Boufflet, J.P., N\u00e9gre, S.: Three methods used to solve an examination timetable problem. In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 327\u2013344"},{"key":"3_CR6","unstructured":"Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines. John Wiley and Sons (1989)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0377-2217(90)90001-R","volume":"46","author":"R.W. Eglese","year":"1990","unstructured":"Eglese, R.W.: Simulated Annealing: a Tool for Operational Research. European Journal of Operational Research 46 (1990) 271\u2013281","journal-title":"European Journal of Operational Research"},{"key":"3_CR8","unstructured":"Dowsland, K.A. Simulated Annealing. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems. Blackwell (1993) 20\u201369."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"785","DOI":"10.2307\/2582319","volume":"38","author":"H.A. Eiselt","year":"1987","unstructured":"Eiselt, H.A., Laporte, G.: Combinatorial Optimisation Problems with Soft and Hard Requirements. Journal of the Operational Research Society 38 (1987) 785\u2013795.","journal-title":"Journal of the Operational Research Society"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"Abramson, D.: Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms. Management Science 37 (1991) 98\u2013113","journal-title":"Management Science"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Dige, P., Lund, C., Ravn, H.F.: Timetabling by Simulated Annealing. In: Vidal, R.V.V. (ed.) Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Vol 396. Springer (1993) 104\u2013124.","DOI":"10.1007\/978-3-642-46787-5_8"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.2307\/3010577","volume":"47","author":"M. Wright","year":"1996","unstructured":"Wright, M.: School Timetabling Using Heuristic Search. Journal of the Operational Research Society 47 (1996) 347\u2013357","journal-title":"Journal of the Operational Research Society"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"J.M. Thompson","year":"1996","unstructured":"Thompson J.M., Dowsland, K.A.: Variants of Simulated Annealing for the Examination Timetabling Problem. Annals of Operations Research 63 (1996) 105\u2013128","journal-title":"Annals of Operations Research"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1991","unstructured":"Hertz, A.: Tabu Search for Large Scale Timetabling Problems. European Journal of Operational Research\n                        54 (1991) 39\u201347","journal-title":"European Journal of Operational Research"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"758","DOI":"10.2307\/2584285","volume":"45","author":"M. Wright","year":"1994","unstructured":"Wright, M.: Timetabling County Cricket Fixtures Using a Form of Tabu Search. Journal of the Operational Research Society 45 (1994) 758\u2013770","journal-title":"Journal of the Operational Research Society"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.2307\/2583452","volume":"42","author":"M. Wright","year":"1991","unstructured":"Wright, M.: Scheduling English Cricket Umpires. Journal of the Operational Research Society 42 (1991) 447\u2013452.","journal-title":"Journal of the Operational Research Society"},{"key":"3_CR17","first-page":"161","volume":"33","author":"D. Costa","year":"1995","unstructured":"Costa, D.: An Evolutionary Tabu Search Algorithm and the NHL Scheduling Problem INFOR 33 (1995) 161\u2013178","journal-title":"INFOR"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0305-0548(95)00012-7","volume":"23","author":"G.M. Thompson","year":"1996","unstructured":"Thompson, G.M.: A Simulated Annealing Heuristic for Shift Scheduling Using Non-continuously Available Employees\u2019, Computers and Operations Research 23 (1996) 275\u2013288","journal-title":"Computers and Operations Research"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.2307\/2584080","volume":"44","author":"M.J. Brusco","year":"1993","unstructured":"Brusco, M.J., Jacobs, L.W.: A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems. Journal of the Operational Research Society 44 (1993) 1191\u20131200","journal-title":"Journal of the Operational Research Society"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Dowsland, K.A.: Using Simulated Annealing for Efficient Allocation of Students to Practical Classes. In: Vidal, R.V.V. (ed.) Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Vol. 396. Springer (1993) 125\u2013150","DOI":"10.1007\/978-3-642-46787-5_7"},{"key":"3_CR21","unstructured":"Dowsland, K.A.: Simulated Annealing Solutions for Multi-objective Scheduling and Timetabling Problems. In: Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (eds.). Modern Heuristic Search Methods John Wiley (1996) 155\u2013167"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Thompson, J.M., Dowsland, K.A.: General Cooling Schedules for a Simulated Annealing Based Timetabling System. In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 345\u2013363.","DOI":"10.1007\/3-540-61794-9_70"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Dowsland, K.A.: Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research (1998) (to appear).","DOI":"10.1016\/S0377-2217(97)00281-6"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling II"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T18:17:26Z","timestamp":1549909046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649793","9783540498032"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0055880","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}