Case-Based Reasoning and Improved Adaptive Search for Project Scheduling

Naval Research Logistics

Volumn 47, Issue 3, 2000, Pages 201-222

  Schirmer, Andreas ^a,b  

^a Deutsche Lufthansa AG   (Germany)

^b UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000103290     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(200004)47:3<201::AID-NAV2>3.0.CO;2-L     Document Type: Article

References (48)

1. R. Alvarez-Valdés and J.M. Tamarit, "Heuristic algorithms for resource-constrained project scheduling: A review and an empirical analysis," Advances in project scheduling, R. Slowinski and J. Weglarz (Editors), Elsevier, Amsterdam, 1989, pp. 113-134.
2. T. Baar, P. Brucker, and S. Knust, Tabu search algorithms for the resource-constrained project scheduling problem, Technical Report, University of Osnabrück, Osnabrück, Germany, 1997.
3. A.B. Badiru, Towards the standardization of performance measures for project scheduling heuristics, IEEE Trans Eng Manage 35 (1988), 82-89.
4. J.C. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA J Comput 6 (1994), 154-160.
5. F.F. Boctor, Some efficient multi-heuristic procedures for resource-constrained project scheduling, Eur J Oper Res 49 (1990), 3-13.
6. J. Böttcher, A. Drexl, R. Kolisch, and F. Salewski, Project scheduling under partially renewable resource constraints, Manage Sci 45 (1999), 543-559.
7. K. Bouleimen and H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem, Technical Report, Service de Robotique et Automatisation, Université de Liège, France, 1998.
8. D.F. Cooper, Heuristics for scheduling resource-constrained projects: An experimental investigation, Manage Sci 22 (1976), 1186-1194.
9. H. Crowder, R. Dembo, and J. Mulvey, On reporting computational experiments with mathematical software, ACM Trans Math Software 5 (1979), 193-203.
10. E.W. Davis and J.H. Patterson, A comparison of heuristic and optimum solutions in resource-constrained project scheduling, Manage Sei 21 (1975), 944-955.
11. B. De Reyck and W.S. Herroelen, On the use of the complexity index as a measure of network complexity in activity networks, Eur J Oper Res 91 (1996), 347-366.
12. J. De Wit and W.S. Herroelen, An evaluation of microcomputer-based software packages for project management, Eur J Oper Res 49 (1990), 102-139.
13. A. Drexl, Scheduling of project networks by job assignment, Manage Sci 37 (1991), 1590-1602.
14. A. Drexl and J. Grünewald, Nonpreemptive multi-mode resource-constrained project scheduling, HE Trans 25 (1993), 74-81.
15. M.R. Garey and D.S. Johnson, Computers and intractability - a guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
16. S. Grolimund and J.-G. Ganascia, Driving tabu search with case-based reasoning. Eur J Oper Res 103 (1997), 326-338.
17. P.J.B. Hancock. An empirical comparison of selection methods in evolutionary algorithms, Evolutionary computing: AISB Workshop, Leeds, UK, Springer-Verlag, Berlin, 1994.
18. J.P. Hart and A.W. Shogan, Semi-greedy heuristics: An empirical study, Oper Res Lett 6 (1987), 107-114.
19. S. Hartmann, A competitive genetic algorithm for resource-constrained scheduling, Nav Res Logistics 45 (1998), 733-750.
20. R.H.F. Jackson, P.T. Boggs, S.G. Nash, and S. Powell, Guidelines for reporting results of computational experiments - Report of the ad hoc Committee, Math Program 49 (1991), 413-425.
21. A. Kimms, Fallbasiertes Schliessen auf Methoden zur Produktionsplanung, Institute für Betriebswirtschaftslehre der Universität Kiel 433, Kiel, Germany, 1997, (in German).
22. R. Kolisch, Project scheduling under resource constraints-efficient heuristics for several problem classes, Physica, Heidelberg, 1995.
23. R. Kolisch, Efficient priority rules for the resource-constrained project scheduling problem, J Oper Manage 14 (1996), 179-192.
24. R. Kolisch, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, Eur J Oper Res 90 (1996), 320-333.
25. R. Kolisch, Resource allocation capabilities of commercial project management packages, Interfaces 29:4 (1999), 19-31.
26. R. Kolisch and A. Drexl, Adaptive search for solving hard project scheduling problems, Nav Res Logistics 43 (1996), 23-40.
27. R. Kolisch and S. Hartmann, "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," Project scheduling- recent models, algorithms and applications, J. Weglarz (Editor), Kluver, Boston, 1999, pp. 147-178.
28. R. Kolisch and A. Sprecher, PSPLIB - a project scheduling problem library, Eur J Oper Res 96 (1997), 205-216.
29. R. Kolisch, C. Schwindt, and A. Sprecher, "Benchmark instances for project scheduling problems," Project scheduling - recent models, algorithms and applications, J. Weglarz (Editor), Kluver, Boston, 1999, pp. 197-212.
30. R. Kolisch, A. Sprecher, and A. Drexl, Characterization and generation of a general class of resource-constrained project scheduling problems, Manage Sci 41 (1995), 1693-1703.
31. J.L. Kolodner. Maintaining organization in a dynamic long term memory, Cognitive Science 7 (1983), 243-279.
32. J.L. Kolodner, Case-based reasoning, Morgan Kaufman, San Mateo, CA, 1993.
33. J.L. Kolodner, R.L. Simpson, and K. Sycara-Cyranski, A process model of case-based reasoning in problem solving, Proc Int Joint Conf Artif Intell, 1985, pp. 284-290.
34. D.R. Kraay and P.T. Harker, Case-based reasoning for repetitive combinatorial optimization problems, Part I: Framework, Journal of Heuristics 2 (1996), 55-85.
35. M. Laguna, T.A. Feo, and H.C. Elrod, A greedy randomized adaptive search procedure for the two-partition problem, Operations Research 42 (1994), 677-687.
36. J.-K. Lee and Y.-D. Kim, Search heuristics for resource constrained project scheduling, J Oper Res Soc 47 (1996), 678-689.
37. V.J. Leon and B. Ramamoorthy, Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling, Oper Res Spektrum 17 (1995), 173-182.
38. K.S. Naphade, S.D. Wu, and R.H. Storer, Problem space search algorithms for resource-constrained project scheduling, Ann Oper Res 70 (1997), 307-326.
39. H. Nübel and C. Schwindt, A classification of shifts, schedules, and objective functions in project scheduling, Report WIOR-509, Universität Karlsruhe, Germany. 1997.
40. L. Ozdamar, A genetic algorithm approach to a general category project scheduling problem, Research Report, Marmara University, Istanbul, Turkey, 1996.
41. J.-C. Pomerol, Artificial intelligence and human decision making, Eur J Oper Res 99 (1997), 3-25.
42. C.R. Reeves, Improving the efficiency of tabu search for machine sequencing problems, J Oper Res Soc 44 (1993), 167-78.
43. R.-C. Schank, Dynamic memory, Cambridge University Press, Cambridge, 1982.
44. A. Schirmer, Advanced biased random sampling in serial and parallel scheduling, Research Report, Universität Kiel, 1997, ftp://www.wiso.uni-kiel.de/pub/operations-research/advanced.ps.gz.
45. A. Schirmer and S. Riesenberg, Parametrized heuristics for project scheduling-biased random sampling methods, Institute für Betriebswirtschaftslehre der Universität Kiel 456, 1997, ftp://www.wiso.uni-kiel.de/pub/operations-research/wp456.ps.gz.
46. A. Schirmer and S. Riesenberg, Class-based control schemes for parametrized project scheduling heuristics, Institute für Betriebswirtschaftslehre der Universität Kiel 471, 1998, ftp://www.wiso.unikiel.de/pub/operations-research/wp471.ps.gz.
47. A. Sprecher, R. Kolisch, and A. Drexl, Semi-active, active, and non-delay schedules for the resource-constrained scheduling problem, Eur J Oper Res 80 (1995), 94-102.
48. R.H. Storer, S.D. Wu, and R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Manage Sci 38 (1992), 1495-509.