Scheduling, timetabling and rostering - A special relationship?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1153, Issue , 1996, Pages 46-75

  Wren, Anthony ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

JOB SHOP SCHEDULING; OPTIMIZATION;

COMPUTER POWER; COMPUTER SOLUTION; DRIVER SCHEDULING; EXAMINATION TIMETABLING; MANUAL INTERVENTION; MATHEMATICAL APPROACH; MATHEMATICAL FORMULATION; META HEURISTICS;

SCHEDULING;

EID: 84958744274     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61794-9_51     Document Type: Conference Paper

References (71)

1. A. Wren (ed.), Computer scheduling of public transport. North-Holland (1981).
2. J-M. Rousseau (ed.), Computer scheduling of public transport - 2. North- Holland (1985).
3. J.R. Daduna and A. Wren (eds.), Computer-aided transit scheduling. Springer- Verlag (1988).
4. M. Desrochers and J-M. Rousseau (eds.), Computer-aided transit scheduling, 2. Springer-Verlag (1992).
5. J.R. Daduna, I. Branco and J.M.P Paixao (eds.), Computer-aided transit scheduling, 3. Springer-Verlag (1995).
6. S. French, Sequencing and scheduling. Ellis Horwood (1982).
7. M. Carey, A model and strategy for train pathing with choice of lines, platforms and routes. Transp. Research, 28B, 333-353 (1994).
8. K. Wolfenden and A. Wren, Locomotive scheduling by computer. In Proceedings of the British Joint Computer Conference, 1EE Conference publication 19, 31-37 (1966).
9. A. Wren, Bus scheduling, an interactive computer method. Transportation Planning and Technology, 1, 115-122 (1972).
10. P.D. Manington and A. Wren, Experiences with a bus scheduling algorithm which saves vehicles. Pre-prints of International Workshop on Urban Passenger Vehicle and Crew Scheduling, Chicago (25 pp.) (1975).
11. B.M. Smith and A. Wren, VAMPIRES and TASC: two successfully applied bus scheduling programs. In A. Wren (ed.) Computer scheduling of public transport. North-Holland, Amsterdam, 97-124 (1981).
12. S.M. Johnson, Optimal two- and three-stage production schedules with set-up times included. Nav. Res. Logist. Q., 1, 61-68 (1954).
13. J.M. Moore, An n-job, one machine sequencing algorithm for minimising the number of late jobs. Mgmt. Sci., 15, 102-109 (1968).
14. E.L. Lawler, Optimal sequencing of a single machine subject to precedence constraints. Mgmt. Sci., 19, 544-546 (1973).
15. H. Miiller-Merbach, Heuristic methods: structures, applications, omputational experience. In R. Cottle & J. Krarup (eds.) Optimisation Methods for Resource Allocation, English Universities Press, 401-416 (1974).
16. S. Lin, Computer solution of the travelling salesman problem. Bell System Technical Journal, 44, 2245-2269 (1965).
17. G.B. Dantzig and J.H. Ramser, The truck dispatching problem. Man.Sci. 6, 8091 (1959).
18. G. Clarke and J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points. Opns.Res. 12, 568-581 (1964).
19. T.J. Gaskell, Bases for vehicle fleet scheduling, Opl.Res.Q., 18, 281-295 (1967).
20. N. Christofides and S. Eilon, An algorithm for the vehicle-dispatching problem. Opl.Res.Q., 20, pp.309-318 (1969).
21. A. Wren, Applications of computers to transport scheduling in the United Kingdom, chapter 10, pp.70-75. West Virginia University Engineering Experiment Station Bulletin 91 (1969).
22. A. Wren and A. Holliday, Computer scheduling of vehicles from one or more depots to a number of delivery points. Opl.Res.Q. 23, 333-344 (1972).
23. B.C. Gillett and L.R. Miller, A heuristic algorithm for the vehicle dispatch problem. Ops.Res., 22(2), 340-349 (1974).
24. B.A. Foster and D.M. Ryan, An integer programming approach to the vehicle scheduling problem. Opl.Res.Q. 27, 367-384 (1976).
25. G. Laporte, The vehicle routing problem: an overview of exact and approximate algorithms. Universite de Montreal, Centre de Recherche sur les Transports, Publication 745 (1991).
26. R.S.K. Kwan, Co-ordination of joint headways. In J.R. Daduna and A. Wren (eds.) Computer-Aided Transit Scheduling. Springer-Verlag, Berlin, 304-314 (1988).
27. W. Keudel, Computer-aided line design (DIANA) and minimisation of transfer times in networks. In J.R. Daduna and A. Wren (eds.) Computer-Aided Transit Scheduling. Springer-Verlag, Berlin, 315-326 (1988).
28. R. Gunther, Untersuchung planerischer und betrieblicher MaBnahmen zur Verbesserung der Anschlussicherung in stadtischen Busnetzen. Schriftenreihe des Instituts fur Verkejrsplanung und Verkehrswegebau der Technischen Universitat Berlin (1985).
29. A.J. Cole, The preparation of examination timetables using a small store computer. Computer Journal, 7, 117-121 (1964).
30. D.C. Wood, A system for computing university examination timetables. Computer Journal, 11,41-47 (1968).
31. A.W. Parker, M.E. Parker and L.G. Proll, Constructing timetables for parent- teacher interviews - a practical scheduling problem. Preprints of Combinatorial Optimisation 81 (C081) 122-137 (1981).
32. B.T. Bennett and R.B. Potts, Rotating roster for a transit system. Transpn.Sci. 2, 14-34 (1968).
33. W. Townsend, Bus crew rostering by computer. University of Leeds MSc thesis (1985).
34. B.M. Smith and S. Bennett, Combining constraint satisfaction and local improvement algorithms to construct anaesthetists' rotas. Proc. Conference on Artificial Intelligence Applications (CAIA 92), 106-112 (1992).
35. N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller and E. Teller, Equation of state calculation by fast computing machines. J. of Chem. Phys., 21, 1087-1091 (1953).
36. S. Kirkpatrick, C.D. Gellatt and M.P. Vecchi, Optimization by simulated annealing. Science, 220, pp.671-680 (1983).
37. S. Kirkpatrick and G.B. Sorkin, Simulated annealing. In M. Arbib (ed.), Handbook of brain theory and neural networks. MIT Press (1995).
38. N.E. Collins, R.W Eglese and B.L. Golden, Simulated annealing - an annotated bibliography. AJMMS, 8, 209-307 (1988).
39. J. Thompson and K.A. Dowsland, Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research (1995).
40. P.M. Ross and D. Corne, Comparing genetic algorithms, stochastic hillclimbing and simulated annealing. In T.C.Fogarty (ed), Evolutionary computing, Springer- Verlag, 94-102(1995).
41. I.H. Osman, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41 (1993).
42. F. Glover, Tabu search - Part 1. ORSAJ. Computing, 1, 190-206 (1989).
43. F. Glover, Tabu search - Part 2. ORSA J. Computing, 2, 4-32 (1990).
44. F. Glover and M. Laguna, Tabu search. In C.R. Reeves (ed.) Modem heuristic techniques for combinatorial problems. Blackwell Scientific Publications, 70-150 (1993).
45. D.E. Goldberg, Genetic algorithms in search, optimisation and machine learning. Addison-Wesley (1989).
46. L. Davis, Handbook of genetic algorithms. Van Nostrand Reinhold (1991).
47. Z. Michalewicz, Genetic algorithms + data structures - evolution programs, second, extended edition. Springer-Verlag (1994).
48. H-L Fang, P.M. Ross and D. Come, A promising genetic algorithm approach to job-shop scheduling, rescheduling and open-shop scheduling problems. In S. Forrest (ed.) Proc. 5th International Conference on Genetic Algorithms. Morgan Kaufmann, 375-382 (1993).
49. A. Wren and D.O. Wren, A genetic algorithm for public transport driver scheduling. Computers Ops Res. 22, 101-110 (1995).
50. R.S.K. Kwan and A. Wren, Hybrid algorithms for bus driver scheduling. To appear in L. Bianco and P. Toth (eds.) Advanced methods in transportation analysis, Springer-Verlag (1996).
51. M. Dorigo, V. Maniezo and A. Colorni, The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B, 26, pp.1-13 (1996).
52. K. Wolfenden and A. Wren, Locomotive scheduling by computer. Proc. British Joint Computer Conference. IEE Conference Publication 19, 31-37 (1966).
53. HI. Stem and A. Ceder, An improved lower bound to the minimum fleet size problem. Transpn.Sci. 17, 471-477 (1983).
54. A. Wren, Computers in Transport Planning and Operation. Ian Allen, London, 103-106(1971).
55. A. Wren, Bus scheduling, an interactive computer method. Transportation Planning and Technology, 1, 115-122 (1972).
56. P.D. Manington and A. Wren, Experiences with a bus scheduliong algorithm which saves vehicles. Preprints o/International Workshop on Urban Passenger Vehicle and Crew Scheduling, Chicago (25 pp) (1975).
57. B.M. Smith and A. Wren, VAMPIRES and TASC: two successfully applied bus scheduling programs. In A. Wren (ed.) Computer scheduling of public transport. North-Holland, Amsterdam, 97-124 (1981).
58. B. Manington and A. Wren, A general computer method for bus crew scheduling. Pre-prints of International Workshop on Urban Passenger Vehicle and Crew Scheduling, Chicago (49 pp) (1975).
59. M.E. Parker and B.M. Smith, Two approaches to computer crew scheduling. In A. Wren (ed.) Computer Scheduling of Public Transport. North-Holland, Amsterdam, 193-222 (1981).
60. S.E.G. Elias, The use of digital computers in the economic scheduling for both man and machine in public transportation. Kansas State University Bulletin, Special Report 49 (1964).
61. A. Wren, General review of the use of computers in scheduling buses and their crews. In A. Wren (ed.) Computer Scheduling of Public Transport. North- Holland, Amsterdam, 3-17 (1981).
62. A. Wren and J-M. Rousseau, Bus driver scheduling - an overview. In J.R. Daduna, I. Branco and J.M.P. Paixao (eds.) Computer aided transit scheduling - 3, Springer-Verlag, Berlin, 173-187 (1995).
63. B.M. Smith and A. Wren, A bus crew scheduling system using a set covering formulation. Transpn.Res. 22A, 97-108 (1988).
64. A. Wren and B.M. Smith, Experiences with a crew scheduling system based on set covering. In J.R. Daduna and A. Wren (eds.) Computer-aided transit scheduling. Springer-Verlag, Berlin, 104-118 (1988).
65. B.M. Smith, IMPACS - a bus crew scheduling system using linear programming. Math Prog. 42, 181-187 (1988).
66. B.M. Smith, Bus crew scheduling using mathematical programming. University of Leeds PhD thesis (1986).
67. J-M. Rousseau and J-Y Blais, HASTUS: an interactive system for buses and crew scheduling. In J-M Rousseau (ed.) Computer Scheduling of Public Transport - 2. North-Holland, Amsterdam, 45-60 (1985).
68. J.R. Daduna and M. Mojsilovic, Computer-aided vehicle and duty scheduling using the HOT programme system. In J.R. Daduna and A. Wren (eds.) Computer-Aided Transit Scheduling. Springer-Verlag, Berlin, 133-146 (1988).
69. A. Wren, R.S.K. Kwan and M.E. Parker, Scheduling of rail driver duties. In T.K.S. Murthy et al. (eds.) Computers in railways IV - Volume 2, Railway Operations, 81-89 (1994).
70. M.E. Parker, A. Wren and R.S.K. Kwan, Modelling the scheduling of train drivers. In J.R. Daduna, I. Branco and J.M.P. Paixao (eds.) Computer aided transit scheduling - 3, Springer-Verlag, Berlin, 359-370 (1995).
71. R.P. Clement and A. Wren, Greedy genetic algorithms, optimizing mutations and bus driver scheduling. In J.R. Daduna, I. Branco and J.M.P. Paixao (eds.) Computer aided transit scheduling - 3, Springer-Verlag, 213-235 (1995).