PSPLIB - A project scheduling problem library

European Journal of Operational Research

Volumn 96, Issue 1, 1997, Pages 205-216

  Kolisch, Rainer ^a   Sprecher, Arno ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Benchmark instances; Project scheduling; Resource constraints

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INFORMATION RETRIEVAL SYSTEMS; ONLINE SEARCHING; PROBLEM SOLVING; RESOURCE ALLOCATION; SUBROUTINES;

BENCHMARK INSTANCES; RESOURCE CONSTRAINTS; SINGLE MODE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (SMRCPSP); SOFTWARE PACKAGE PROGEN;

SCHEDULING;

EID: 0030788844     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00170-1     Document Type: Article

References (36)

1. Ahn, T., and Erenguc, S., "Resource constrained project scheduling problem with multiple crashable modes: An exact solution procedure", Research Report, Department of Decision and Information Sciences, University of Florida, 1995.
2. Ahn, T., and Erenguc, S., "Resource constrained project scheduling problem with multiple crashable modes: A heuristic solution procedure", Research Report, Department of Decision and Information Sciences, University of Florida, 1995.
3. Christofides, N., Alvarez-Valdes, R., and Tamarit, J.M., "Project scheduling with resource constraints: A branch and bound approach", European Journal of Operational Research 29 (1987) 262-273.
4. Davis, E.W., and Heidorn, G.E., "An algorithm for optimal project scheduling under multiple resource constraints", Management Science 17 (1971) B803-B816.
5. Demeulemeester, E., and Herroelen, W., "A branch-and-bound procedure for the multiple resource-constrained project scheduling problem", Management Science 38/12 (1992) 1803-1818.
6. Demeulemeester, E., and Herroelen, W., "New benchmark results for the resource-constrained project scheduling problem", Research Report 9521, Department of Applied Economics, Katholieke Universiteit Leuven, 1995.
7. De Reyck, B., and Herroelen, W., "Assembly line balancing by resource-constrained project scheduling techniques - A critical appraisal", Research Report 9505, Department of Applied Economics, Katholieke Universiteit Leuven, 1995.
8. De Reyck, B., and Herroelen, W., "On the use of the complexity index as a measure of complexity in activity networks", European Journal of Operational Research, to appear.
9. Grinold, R.C., "The payment scheduling problem", Naval Research Logistics Quarterly 19 (1972) 123-136.
10. Icmeli, O., and Erenguc, S.S., "A branch and bound procedure for the resource constrained project scheduling problem with discounted cash flows", Research Report, Department of Decision and Information Sciences, University of Florida, 1995.
11. Icmeli, O., and Rom, W.O., "Solving the resource constrained project scheduling problem with optimization subroutine library", Research Report, Departement of Operations Management and Business Statistics, Cleveland State University, 1995.
12. Garey, M.R., and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco, CA, 1979.
13. Kolisch, R., "Serial and parallel resource-constrained project scheduling methods revisited - Theory and computation", European Journal of Operational Research, 90 (1996) 320-333.
14. Kolisch, R., "Efficient priority rules for the resource constrained project scheduling problem", Journal of Operations Management, to appear.
15. Kolisch, R., and Drexl, A., "Local search for nonpreemptive multi-mode resource-constrained project scheduling", Research Report 360, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 1994.
16. Kolisch, R., and Drexl, A., "Adaptive search for solving hard project scheduling problems", Naval Research Logistics 43 (1996) 23-40.
17. Kolisch, R., Sprecher, A., and Drexl, A., "Characterization and generation of a general class of resource-constrained project scheduling problems - Easy and hard instances", Research Report 301, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 1992.
18. Kolisch, R., Sprecher, A., and Drexl, A., "Characterization and generation of a general class of resource-constrained project scheduling problems", Management Science 41 (1995) 1693-1703.
19. Mingozzi, A., Maniezzo, V., Ricciardelli, S., and Bianco, L., "An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation", Research Report 32, Department of Mathematics, University of Bologna, 1994.
20. Naphade, K.S., Wu, S.D., and Storer, R.H., "Problem space search algorithms for the resource-constrained project scheduling problem", Research Report, Department of Industrial and Manufacturing Systems Engineering, Lehigh University, 1995.
21. Patterson, J.H., "A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem", Management Science 30 (1984) 854-867.
22. Patterson, J.H., Slowinski, R., Talbot, F.B., and Weglarz, J., "An algorithm for a general class of precedence and resource constrained scheduling problems", in: R. Slowinski and J. Weglarz (eds.): Advances in Project Scheduling. Elsevier, Amsterdam, 1989, 3-28.
23. Patterson, J.H., Slowinski, R., Talbot, F.B., and Weglarz, J., "Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems", European Journal of Operational Research 49 (1990) 68-79.
24. Radermacher, F.J., "Scheduling of project networks", Annals of Operations Research 4 (1985/86) 227-252.
25. Schwindt, C., "ProGen/max: A new problem generator for different resource-constrained project planning problems with minimal and maximal time lags", Research Report WIOR-449, Universität Karlsruhe, 1995.
26. Slowinski, R., "Two approaches to problems of resource allocation among project activities: A comparative study", Journal of the Operational Research Society, 31 (1980) 711-723.
27. Slowinski, R., "Multiobjective network scheduling with efficient use of renewable and nonrenewable resources", European Journal of Operational Research 1 (1981) 265-273.
28. Sprecher, A., Resource-constrained Project Scheduling -Exact Methods for the Multi-Mode Case. Springer-Verlag, Berlin, 1994.
29. Sprecher, A., Hartmann, S., and Drexl, A., "Project scheduling with discrete time-resource and resource-resource trade-offs", Research Report 357, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 1995.
30. Sprecher, A., and Drexl, A., "Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. Part I: Theory", Research Report 385, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 1996.
31. Sprecher, A., and Drexl, A., "Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. Part II: Computation", Research Report 386, Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, 1996.
32. Stinson, J.P., Davis, E.W., and Khumawala, B.M., "Multiple resource-constrained scheduling using branch and bound", AIIE Transactions 10 (1978) 252-259.
33. Storer, R.H., Wu, S.D., and Vaccari, R., "New search spaces for sequencing problems with application to job shop scheduling", Management Science 38 (1992) 1495-1509.
34. Talbot, F.B., "Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case", Management Science 28 (1982) 1197-1210.
35. Weglarz, J., "Project scheduling with discrete and continuous resources", IEEE Transactions on Systems, Man, and Cybernetics 9 (1979) 644-650.
36. Weglarz, J., "On certain models of resource allocation problems", Kybernetics 9 (1980) 61-66.