Complex scheduling, second edition

Complex Scheduling, Second Edition

Volumn , Issue , 2012, Pages 1-340

  Brucker, Peter ^a   Knust, Sigrid ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85026684694     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-23929-8     Document Type: Book

References (193)

1. Aarts, E.H.L., van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J. (1994): A computational study of local search algorithms for job shop scheduling, ORSA Journal on Computing 6, 118-125.
2. Aarts, E.H.L., Lenstra, J.K. (1997): Local Search in Combinatorial Optimization, John Wiley.
3. Ahuja, R.K., Magnanti, T.L., Orlin, J.B. (1993): Network Flows, Prentice Hall, Englewood Cliffs.
4. Alvarez-Valdés, R., Tamarit, J.M. (1989): Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis, in: R. Słowiński, J. Wȩglarz, (eds.): Advances in Project Scheduling, Elsevier Science, Amsterdam, 114-134.
5. Alvarez-Valdés, R., Tamarit, J.M. (1993): The project scheduling polyhedron: Dimension, facets and lifting theorems, European Journal of Operational Research 67, 204-220.
6. Artigues, C., Michelon, P., Reusser, S. (2003): Insertion techniques for static and dynamic resource-constrained project scheduling, European Journal of Operational Research 149, 249-267.
7. Artigues, C., Demassey, S., Néron, E. (2008): Resource-Constrained Project Scheduling - Models, Algorithms, Extensions and Applications, ISTE Ltd and John Wiley.
8. Baar, T., Brucker, P., Knust, S. (1998): Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem, in: S. Voss, S. Martello, I. Osman, C. Roucairol (eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, 1-18.
9. Baptiste, P., Le Pape, C. (1996): Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling, in: Proceedings of the 15th Workshop of the UK Planning Special Interest Group, Liverpool.
10. Baptiste, P., Le Pape, C., Nuijten, W. (2001): Constraint-Based Scheduling - Applying Constraint Programming to Scheduling Problems, International Series in Operations Research and Management Science 39, Kluwer, Dordrecht.
11. Baptiste, P., Demassey, S. (2004): Tight LP bounds for resource constrained project scheduling, OR Spectrum 26, 251-262.
12. Barták, R. (1999): Constraint programming: In pursuit of the holy grail, in: Proceedings of the Week of Doctoral Students (WDS99), Part IV, MatFyzPress, Prague, 555-564.
13. Barták, R. (2001): Theory and practice of constraint propagation, in: Proceedings of the 3rdWorkshop on Constraint Programming for Decision and Control (CPDC2001), Wydavnictvo Pracovni Komputerowej, Gliwice, Poland, 7-14.
14. Bartels, H., Zimmermann, J. (2009): Scheduling tests in automotive R&D projects, European Journal of Operational Research, 193, 805-819.
15. Bartusch, M., Möhring, R.H., Radermacher, F.J. (1988): Scheduling project networks with resource constraints and time windows, Annals of Operations Research 16, 201-240.
16. Bellman, R.E. (1958): Dynamic Programming, Princeton University Press.
17. Bertsekas, D. (1999): Nonlinear Programming, 2nd ed., Athena Scientific.
18. Bland, R.G. (1977): New finite pivoting rules for the simplex method, Mathematics of Operations Research 2, 103-107.
19. Błażewicz, J., Domschke, W., Pesch, E. (1996): The job shop scheduling problem: conventional and new solution techniques, European Journal of Operational Research 93, 1-33.
20. Błażewicz, J., Ecker, K., Pesch, E., Schmidt, G., Wȩglarz, J. (2001): Scheduling Computer and Manufacturing Processes, 2nd ed., Springer, Berlin.
21. Błażewicz, J., Ecker, K., Pesch, E., Schmidt, G., Wȩglarz, J. (2007): Handbook on Scheduling, Springer, Berlin.
22. Błażewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G. (1983): Scheduling subject to resource constraints: Classification and complexity, Discrete Applied Mathematics 5, 11-24.
23. Böttcher, J., Drexl, A., Kolisch, R., Salewski, F. (1999): Project scheduling under partially renewable resource constraints, Management Science 45, 543-559.
24. Bomsdorf, F., Derigs, U. (2008): A model, heuristic procedure and decision support system for solving the movie shot scheduling problem, OR Spectrum 30, 751-772.
25. Bouleimen, K., Lecocq, H. (2003): A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version, European Journal of Operational Research 149, 268-281.
26. Brimberg, J., Hurley, W.J., Wright, R.E. (1996): Scheduling workers in a constricted area, Naval Research Logistics 43, 143-149.
27. Brucker, P. (2004): Scheduling Algorithms, 4th ed., Springer, Berlin.
28. Brucker, P., Drexl, A., Möhring, R.H., Neumann, K., Pesch, E. (1999): Resource-constrained project scheduling: notation, classification, models and methods, European Journal of Operational Research 112, 3-14.
29. Brucker, P., Heitmann, S., Hurink, J. (2003): Flow-shop problems with intermediate buffers, OR Spectrum 25, 549-574.
30. Brucker, P., Heitmann, S., Hurink, J., Nieberg, T. (2006): Jobshop scheduling with limited capacity buffers, OR Spectrum 28, 151-176.
31. Brucker, P., Jurisch, B., Krämer, A. (1996): The job-shop problem and immediate selection, Annals of Operations Research 50, 73-114.
32. Brucker, P., Jurisch, B., Sievers, B. (1994): A fast branch and bound algorithm for the job shop scheduling problem, Discrete Applied Mathematics 49, 107-127.
33. Brucker, P., Knust, S., Schoo, A., Thiele, O. (1998): A branch & bound algorithm for the resource-constrained project scheduling problem, European Journal of Operational Research 107, 272-288.
34. Brucker, P., Knust, S. (2000): A linear programming and constraint propagation-based lower bound for the RCPSP, European Journal of Operational Research 127, 355-362.
35. Brucker, P., Knust, S. (2001): Resource-constrained project scheduling and timetabling, in: E. Burke, W. Erben (ed.): The Practice and Theory of Automated Timetabling III, Springer Lecture Notes in Computer Science 2079, 277-293.
36. Brucker, P., Knust, S. (2002): Lower bounds for scheduling a single robot in a job-shop environment, Annals of Operations Research 115, 147-172.
37. Brucker, P., Knust, S. (2003): Lower bounds for resource-constrained project scheduling problems, European Journal of Operational Research 149, 302-313.
38. Brucker, P., Knust, S.: Complexity classification of scheduling problems, http://www.informatik.uni-osnabrueck.de/knust/class/.
39. Brucker, P., Qu, R., Burke, E. (2011): Personnel scheduling: Models and complexity, European Journal of Operational Research 210, 467-473.
40. Brucker, P., Schumacher, D. (1999): A new tabu search procedure for an audit-scheduling problem, Journal of Scheduling 2, 157-173.
41. Carlier, J., Pinson, E. (1989): An algorithm for solving the job-shop problem, Management Science 35, 164-176.
42. Carlier, J., Pinson, E. (1990): A practical use of Jackson’s preemptive schedule for solving the job-shop problem, Annals of Operations Research 26, 269-287.
43. Carlier, J., Pinson, E. (1994): Adjustments of heads and tails for the job-shop problem, European Journal of Operational Research 78, 146-161.
44. Christofides, N., Alvarez-Valdés, R., Tamarit, J.M. (1987): Project scheduling with resource constraints: a branch and bound approach, European Journal of Operational Research 29, 262-273.
45. Chvátal, V. (1983): Linear Programming, W.H. Freeman and Company, New York - San Francisco.
46. Cook, S.A. (1971): The complexity of theorem-proving procedures, Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 151-158.
47. Crama, Y., Kats, V., Klundert, J. van de, Levner, E. (2000): Cyclic scheduling in robotic flowshops, Annals of Operations Research 96, 97-124.
48. Davies, E.M. (1973): An experimental investigation of resource allocation in multiactivity projects, Operational Research Quarterly 24, 587-591.
49. Davis, M., Putnam, H. (1960): A computing procedure for quantification theory, Journal of the Association for Computing Machinery 7, 201-215.
50. Davis, M., Logemann, G., Loveland, D. (1962): A machine program for theorem-proving, Communications of the Association for Computing Machinery 5, 394-397.
51. Debels, D., Vanhoucke, M. (2007): A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem, Operations Research 55, 457-469.
52. Dell’ Amico, M., Trubian, M. (1993): Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41, 231-252.
53. Demassey, S., Artigues, C., Michelon, P. (2005): Constraint-propagation- based cutting planes: An application to the resource-constrained project scheduling problem, INFORMS Journal on Computing 17, 52-65.
54. Demeulemeester, E. (1992): Optimal algorithms for various classes of multiple resource-constrained project scheduling problem, Ph.D. thesis, Katholieke Universiteit Leuven, Belgium.
55. Demeulemeester, E., De Reyck, B., Herroelen, W. (2000): The discrete time/resource trade-off problem in project networks: A branchand- bound approach, IIE Transactions 32, 1059-1069.
56. Demeulemeester, E., Herroelen, W. (1992): A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Management Science 38, 1803-1818.
57. Demeulemeester, E., Herroelen, W. (1997): New benchmark results for the resource-constrained project scheduling problem, Management Science 43, 1485-1492.
58. Demeulemeester, E., Herroelen, W. (2002): Project Scheduling: A Research Handbook, Kluwer, Dordrecht.
59. De Reyck, B., Demeulemeester, E., Herroelen, W. (1998): Local search methods for the discrete time/resource trade-off problem in project networks, Naval Research Logistic Quarterly 45, 553-578.
60. De Reyck, B., Herroelen, W. (1998): A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations, European Journal of Operational Research 111, 152-174.
61. De Reyck, B., Herroelen, W. (1999): The multi-mode resourceconstrained project scheduling problem with generalized precedence relations, European Journal of Operational Research 119, 538-556.
62. Dijkstra, E. (1959): A note on two problems in connexion with graphs, Numerische Mathematik 1, 269-271.
63. Dodin, B., Elimam, A.A., Rolland, E. (1998): Tabu search in audit scheduling, European Journal of Operational Research 106, 373-392.
64. Dorigo, M., Di Caro, G., Gambardella, L.M. (1999): Ant algorithms for discrete optimization, Artificial Life 5, 137-172.
65. Dorndorf, U. (2002): Project Scheduling with Time Windows - From Theory to Applications, Contributions to Management Science, Physica-Verlag, Heidelberg.
66. Dorndorf, U., Pesch, E., Phan-Huy, T. (1998): A survey of interval consistency tests for time- and resource-constrained scheduling, in: [191], 213-238.
67. Dorndorf, U., Pesch, E., Phan-Huy, T. (2000): Constraint propagation techniques for the disjunctive scheduling problem, Artificial Intelligence 122, 189-240.
68. Dorndorf, U., Pesch, E., Phan-Huy, T. (2000): A time-oriented branch-and-bound algorithm for project scheduling with generalised precedence constraints, Management Science 46, 1365-1384.
69. Drexl, A., Knust, S. (2007): Sports league scheduling: graph- and resource-based models, Omega - International Journal of Management Science 35, 465-471.
70. Drexl, A., Salewski, F. (1997): Distribution requirements and compactness constraints in school timetabling, European Journal of Operational Research 102, 193-214.
71. Drezet, L.-E., Billaut, J.-C. (2008): A project scheduling problem with labour constraints and time-dependent activities requirements, European Journal of Operational Research, 112, 217-225.
72. Dumas, Y., Desrosiers, J., Gelinas, E. (1995): An optimal algorithm for the traveling salesman problem with time windows, Operations Research 43, 367-371.
73. Eglese, R.W. (1990): Simulated annealing: A tool for operational research, European Journal of Operational Research 46, 271-281.
74. Fest, A., Möhring, R.H., Stork, F., Uetz, M. (1998): Resourceconstrained project scheduling with time windows: A branching scheme based on dynamic release dates, Technical Report 596, Technische Universit ät Berlin, 1998.
75. Fisher, M.L. (1973): Optimal solution of scheduling problems using Lagrange multipliers: Part I, Operations Research 21, 1114-1127.
76. Fisher, M.L. (1981): The Lagrangian relaxation method for solving integer programming problems, Management Science 27, 1-18.
77. Floyd, R.W. (1962): Algorithm 97: Shortest path, Communications of the Association for Computing Machinery 5, 345.
78. Ford, L.R., Fulkerson, D.R. (1956): Maximal flow through a network, Canadian Journal of Mathematics 8, 399-404.
79. Garey, M., Johnson, D.S. (1979): Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York.
80. Geoffrion, A.M. (1974): Lagrangean relaxation for integer programming, Mathematical Programming Study 2, 82-114.
81. Gilmore, P.C., Gomory, R.E. (1961): A linear programming approach to the cutting-stock problem, Operations Research 9, 849-859.
82. Glover, F. (1989): Tabu Search, Part I, ORSA Journal of Computing 1, 190-206.
83. Glover, F. (1990): Tabu Search, Part II, ORSA Journal of Computing 2, 4-32.
84. Glover, F., Laguna, M. (1997): Tabu Search, Kluwer, Dordrecht.
85. Golumbic, M.C. (1980): Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
86. Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B. (2008): Satisfiability solvers, in: Handbook of Knowledge Representation, Elsevier, 89-134.
87. Grabowski, J., Nowicki, E. Zdrzalka, S. (1986): A block approach for single machine scheduling with release dates and due dates, European Journal of Operational Research 26, 278-285.
88. Haase, K., Latteier, J., Schirmer, A. (1998): The course scheduling problem at Lufthansa Technical Training, European Journal of Operational Research 110, 441-456.
89. Hartmann, S. (1998): A competitive genetic algorithm for resourceconstrained project scheduling, Naval Research Logistics 45, 733-750.
90. Hartmann, S. (2000): Packing problems and project scheduling models: An integrating perspective, Journal of the Operational Research Society 51, 1083-1092.
91. Hartmann, S. (2001): Project scheduling with multiple modes: A genetic algorithm, Annals of Operations Research 102, 111-135.
92. Hartmann, S. (2002): A self-adapting genetic algorithm for project scheduling under resource constraints, Naval Research Logistics 49, 433-488.
93. Hartmann, S., Briskorn, D. (2010): A survey of variants and extensions of the resource-constrained project scheduling problem, European Journal of Operational Research 207, 1-14.
94. Hartmann, S., Drexl, A. (1998): Project scheduling with multiple modes: A comparison of exact algorithms, Networks 32, 283-297.
95. Hartmann, S., Kolisch, R. (2000): Experimental evaluation of stateof- the-art heuristics for the resource-constrained project scheduling problem, European Journal of Operational Research 127, 394-407.
96. Heilmann, R. (1999): Das ressourcenbeschränkte Projektdauerminimierungsproblem im Mehr-Modus-Fall, Ph.D. thesis (in German), University of Karlsruhe, Germany.
97. Held, M., Karp, R.M. (1970): The traveling-salesman problem and minimum spanning trees, Operations Research 21, 1138-1162.
98. Held, M., Karp, R.M. (1971): The traveling-salesman problem and minimum spanning trees: Part II, Mathematical Programming 1, 6-25.
99. Hentenryck, P. van (1992): Constraint Satisfaction in Logic Programming, MIT Press, Cambridge.
100. Herroelen, W., Demeulemeester, E., De Reyck, B. (1998): Resource-constrained project scheduling - A survey of recent developments, Computers & Operations Research 25, 279-302.
101. Holland, S. (1975): Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI.
102. Horbach, A. (2010): A Boolean satisfiability approach to the resourceconstrained project scheduling problem, Annals of Operations Research 181, 89-107.
103. Hurink, J., Jurisch, B., Thole, M. (1994): Tabu search for the job shop scheduling problem with multi-purpose machines, OR Spektrum 15, 205-215.
104. Hurink, J., Knust, S. (2002): A tabu search algorithm for scheduling a single robot in a job-shop environment, Discrete Applied Mathematics 112, 181-203.
105. Hurink, J., Knust, S. (2005): Tabu search algorithms for job-shop problems with a single transport robot, European Journal of Operational Research 162, 99-111.
106. Jain, A.S., Meeran, S. (1999): Deterministic job-shop scheduling: Past, present and future, European Journal of Operational Research 113, 390-434.
107. Józefowska, J., Wȩglarz, J. (2006): Perspectives in Modern Project Scheduling, International Series in Operations Research & Management Science, Volume 92, Springer.
108. Kelley, J.E. (1963): The critical path method: Resource planning and scheduling, in: J.F. Muth, G.L. Thompson (eds.): Industrial Scheduling, Prentice Hall, New Jersey, 347-365.
109. Kendall, G., Knust, S., Ribeiro, C., Urrutia, S. (2010): Sports scheduling: An annotated bibliography, Computers & Operations Research 37, 1-19.
110. Khachian, L.G. (1979): A polynomial algorithm in linear programming, Soviet Math. Dokl. 20, 191-194.
111. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P. (1983): Optimization by simulated annealing, Science 220, 671-680.
112. Klee, V., Minty, G.J. (1972): How good is the simplex algorithm? Inequalities III, roc. 3rd Symp., Los Angeles 1969, 159-175.
113. Klein, M. (1967): A primal method for minimal cost flows with application to the assignment and transportation problems, Management Science 14, 205-220.
114. Klein, R., Scholl, A. (1999): Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling, European Journal of Operational Research 112, 322-346.
115. Knust, S. (1999): Shop-scheduling problems with transportation, Ph.D. thesis, University of Osnabrück, Germany.
116. Knust, S. (2010): Scheduling non-professional table-tennis leagues, European Journal of Operational Research 200, 358-367.
117. Kolisch, R. (1996): Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, European Journal of Operational Research 90, 320-333.
118. Kolisch, R., Hartmann, S. (1998): Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis, in: [191], 147-178.
119. Kolisch, R., Hartmann, S. (2006): Experimental investigation of heuristics for resource-constrained project scheduling: An update, European Journal of Operational Research 174, 23-37.
120. Kolisch, R., Padman, R. (2001): An integrated survey of deterministic project scheduling, Omega - International Journal of Management Science 29, 249-272.
121. Kolisch, R., Schwindt, C., Sprecher, A. (1998): Benchmark instances for project scheduling problems, in: [191], 197-212.
122. Kolisch, R., Sprecher, A., Drexl, A. (1995): Characterization and generation of a general class of resource-constrained project scheduling problems, Management Science 41, 1693-1703.
123. Kolisch, R., Sprecher, A. (1997): PSPLIB - A project scheduling library, European Journal of Operational Research 96, 205-216.
124. Koné, O., Artigues, C., Lopez, P., Mongeau, M. (2011): Eventbased MILP models for resource-constrained project scheduling problems, Computers & Operations Research 38, 3-13.
125. Korte, B., Möhring, R.H. (1985): Transitive orientation of graphs with side constraints, in: H. Noltemeier (ed.): Proceedings 11th International Workshop on Graph Theoretic Concepts in Computer Science, Trauner Verlag, Linz, 143-160.
126. Korte, B., Vygen, J. (2002): Combinatorial Optimization - Theory and Algorithms, 2nd ed., Springer, Berlin.
127. Koulamas, C., Antony, S.R., Jaen, R. (1994): A survey of simulated annealing applications to operations research problems, Omega -International Journal of Management Science 22, 41-56.
128. Krämer, B. (1997): Branch-and-bound methods for scheduling problems with multiprocessor tasks on dedicated processors, OR Spektrum 19, 219-227.
129. Krüger, D., Scholl, A. (2010): Managing and modelling general resource transfers in (multi-)project scheduling, OR Spektrum 32, 369-394.
130. Kumar, V. (1992): Algorithms for constraint satisfaction problems, Artificial Intelligence Magazine 13, 32-44.
131. Kuster, J., Jannach, D. (2006): Handling airport ground processes based on resource-constrained project scheduling, Lecture Notes in Artificial Intelligence 4031, Springer, 166-176.
132. Lawler, E.L. (1976): Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
133. Leisten, R. (1990): Flowshop sequencing problems with limited buffer storage, International Journal of Production Research 28, 2085-2100.
134. Li, K., Willis, R. (1992): An iterative scheduling technique for resourceconstrained project scheduling, European Journal of Operational Research 56, 370-379.
135. Leung, J.T. (2004): Handbook of Scheduling, CRC Press.
136. Lorenzoni, L.L., Ahonen, H., de Alvarenga, A.G. (2006): A multimode resource-constrained scheduling problem in the context of port operations, European Journal of Operational Research 50, 55-65.
137. Malcolm, D.G., Roseboom, J.H., Clark, C.E., Fazar, W. (1959): Application of a technique for research and development program evaluation, Operations Research 7, 646-669.
138. Martin, P.B. (1996): A time-oriented approach to computing optimal schedules for the job shop scheduling problem, Ph.D. thesis, Graduate School of Cornell University, USA.
139. Martin, P., Shmoys, D. (1996): A new approach to computing optimal schedules for the job-shop scheduling problem, in: Proceedings of the 5th International IPCO Conference.
140. Mascis, A., Pacciarelli, D. (2000): Machine scheduling via alternative graphs, Report DIA-46-2000, University of Rome, Italy.
141. Mascis, A., Pacciarelli, D. (2002): Job-shop scheduling with blocking and no-wait constraints, European Journal of Operational Research 143, 498-517.
142. Mastrolilli, M., Gambardella, L.M. (2000): Effective neighbourhood functions for the flexible job shop problem, Journal of Scheduling 3, 3-20.
143. Mellentien, C., Schwindt, C., Trautmann, N. (2004): Scheduling the factory pick-up of new cars, OR Spectrum 26, 579-601.
144. Merkle, D., Middendorf, M., Schmeck, H. (2002): Ant colony optimization for resource-constrained project scheduling, IEEE Transactions on Evolutionary Computation 6, 333-346.
145. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L. (1998): An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation, Management Science 44, 714-729.
146. Möhring, R.H. (1985): Algorithmic aspects of comparability graphs and interval graphs, in: I. Rival (ed.): Graphs and order: the role of graphs in the theory of ordered sets and its applications, NATO Advanced Science Institute Series C, Mathematical and Physical Sciences, 41-101.
147. Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M. (2001): On project scheduling with irregular starting time costs, Operations Research Letters 28, 149-154.
148. Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M. (2003): Solving project scheduling problems by minimum cut computations, Management Science 49, 330-350.
149. Muth, J.F., Thompson, G.L. (1963): Industrial Scheduling, Englewood Cliffs, N.J., Prentice Hall.
150. Néron, E., Artigues, C., Baptiste, P., Carlier, J., Damay, J., Demassey, S., Laborie, P. (2006): Lower bounds for resource constrained project scheduling problem - Recent advances, in: [107], 167-204.
151. Neumann, K., Schwindt, C. (2002): Project scheduling with inventory constraints. Mathematical Methods of Operations Research 56, 513-533.
152. Neumann, K., Schwindt, C., Trautmann, N. (2002): Advanced production scheduling for batch plants in process industries, OR Spectrum 24, 251-279.
153. Neumann, K., Schwindt, C., Zimmermann, J. (2003): Project Scheduling with Time Windows and Scarce Resources - Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions, Springer, Berlin.
154. Nowicki, E. (1999): The permutation flow shop with buffers: A tabu search approach, European Journal of Operational Research 116, 205-219.
155. Nowicki, E., Smutnicki, C. (1996): A fast taboo search algorithm for the job shop problem, Management Science 42, 797-813.
156. Nowicki, E., Smutnicki, C. (1996): A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research 91, 160-175.
157. Nowicki, E., Smutnicki, C. (2005): An advanced tabu search algorithm for the job-shop problem, Journal of Scheduling 8, 145-159.
158. Nuijten, W. (1994): Time and resource constrained scheduling: A constraint satisfaction approach, Ph.D. thesis, Technical University Eindhoven, The Netherlands.
159. Özdamar, L., Ulusoy, G. (1995): A survey on the resource-constrained project scheduling problem, IIE Transactions 27, 574-586.
160. Papadimitriou, C.H., Kanellakis, P.C. (1980): Flow-shop scheduling with limited temporary storage, Journal of the Association for Computing Machinery 27, 533-549.
161. Papadimitriou, C.H., Steiglitz, K. (1982): Combinatorial Optimization, Prentice Hall, Englewood Cliffs, N.J.
162. Patterson, J.H., Slowinski, R., Talbot, F.B., Wȩglarz, J. (1989): An algorithm for a general class of precedence and resource constrained scheduling problems, in: R. Słowiński, J. Wȩglarz, (eds.): Advances in Project Scheduling, Elsevier Science, Amsterdam, 3-28.
163. Patterson, J.H., Slowinski, R., Talbot, F.B., Wȩglarz, J. (1990): Computational experience with a backtracking algorithm for solving a general class of resource constrained scheduling problems, European Journal of Operational Research 90, 68-79.
164. Phan Huy, T. (1999): Constraint propagation in flexible manufacturing, Ph.D. thesis, University of Bonn, Germany.
165. Pinedo, M. (2008): Scheduling: Theory, Algorithms, and Systems, 3rd ed., Springer.
166. Pinedo, M. (2009): Planning and Scheduling in Manufacturing and Services, 2nd ed., Springer, Berlin.
167. Pinson, E. (1995): The job-shop scheduling problem: A concise survey and some recent developments, in: P. Chretienne, E.G. Coffman, J.K. Lenstra, Z. Liu (eds.): Scheduling Theory and its Applications, John Wiley, 277-293.
168. Pritsker, A., Watters, L., Wolfe, P. (1969): Multiproject scheduling with limited resources: A zero-one programming approach, Management Science 16, 93-107.
169. PSPLIB - Project Scheduling Problem Library http://129.187.106.231/psplib/main.html
170. Roy, B., Sussmann, B. (1964): Les problemes d’ordonnancement avec constraintes disjonctives, Note DS no. 9 bis, SEMA, Paris.
171. Salewski, F., Schirmer, A., Drexl, A. (1997): Project scheduling under resource and mode identity constraints: Model, complexity, methods, and applications, European Journal of Operational Research 102, 88-110.
172. Schaerf, A. (1995): A survey of automated timetabling, CWI-Report CS-R 9567, Amsterdam.
173. Schirmer, A., Drexl, A. (2001): Allocation of partially renewable resources: Concept, capabilities, and applications, Networks 37, 21-34.
174. Schrijver, A. (2003): Combinatorial Optimization: Polyhedra and Efficiency, Springer, Berlin.
175. Schwindt, C., Trautmann, N. (2000): Batch scheduling in process industries: An application of resource-constrained project scheduling, OR Spectrum 22, 501-424.
176. Smutnicki, C. (1998): A two-machine permutation flow-shop problem with buffers, OR Spektrum 20, 229-235.
177. Sprecher, A. (1994): Resource-constrained project scheduling - Exact methods for the multi-mode case, Lecture Notes in Economics and Mathematical Systems 409, Springer, Berlin.
178. Sprecher, A., Drexl, A. (1998): Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm, European Journal of Operational Research 107, 431-450.
179. Sprecher, A., Drexl, A. (1999): Note: On semi-active timetabling in resource-constrained project scheduling, Management Science 45, 452-454.
180. Sprecher, A., Hartmann, S., Drexl, A. (1997): An exact algorithm for project scheduling with multiple modes, OR Spektrum 19, 195-203.
181. Sprecher, A., Kolisch, R., Drexl, A. (1995): Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem, European Journal of Operational Research 80, 94-102.
182. Stinson, J.P., Davis, E.W., Khumawala, B.M. (1978): Multiple resource-constrained scheduling using branch and bound, AIIE Transactions 10, 252-259.
183. Stützle, T., Dorigo, M. (1999): ACO algorithms for the traveling salesman problem, in: K. Miettinen, M. Mäkelä, P. Neittaanmäki, J. Periaux (eds.): Evolutionary Algorithms in Engineering and Computer Science: Recent Advances in Genetic Algorithms, Evolution Strategies, Evolutionary Programming, Genetic Programming and Industrial Applications, John Wiley, 163-183.
184. Tsang, E. (1993): Foundations of Constraint Satisfaction, Academic Press, Essex.
185. Valls, V., Ballestin, F., Quintanilla, S. (2005): Justification and RCPSP: A technique that pays, European Journal of Operational Research 165, 375-386.
186. van de Velde, S.L. (1991): Machine scheduling and Lagrangian relaxation, Ph.D. thesis, Technical University Eindhoven, The Netherlands.
187. van Laarhoven, P.J.M., Aarts, E.H.L. (1987): Simulated Annealing: Theory and Applications, Reidel, Dordrecht.
188. van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K. (1992): Job shop scheduling by simulated annealing, Operations Research 40, 113-125.
189. Vilim, P. (2004): O(n log n) filtering algorithms for unary resource constraint, in: Proceedings of CPAIOR 2004, Nice, France.
190. Watson, J.-P., Howe, A.E., Whitley, L.D. (2006): Deconstructing Nowicki and Smutnicki’s i-TSAB tabu search algorithm for the job-shop scheduling problem, Computers & Operations Research 33, 2623-2644.
191. Wȩglarz, J. (1998): Project Scheduling: Recent Models, Algorithms and Applications, Kluwer, Dordrecht.
192. Wȩglarz, J., Józefowska, J., Mika, M., Waligóra, G. (2011): Project scheduling with finite or infinite number of activity processing modes - A survey, European Journal of Operational Research 208, 177-205.
193. Wennink, M. (1995): Algorithmic support for automated planning boards, Ph.D. thesis, Technical University Eindhoven, The Netherlands.