Preview

Труды Института системного программирования РАН

Расширенный поиск

Современные модели и методы теории расписаний

https://doi.org/10.15514/ISPRAS-2014-26(3)-1

Полный текст:

Аннотация

Статья посвящена важной проблеме систематизации и концептуализации теории расписаний, которая находит применение в таких предметных областях как управление производством, организация транспортных потоков, планирование проектов, управление ресурсами в вычислительных системах. Однако разнообразие математических моделей и методов составления расписаний обычно ставит перед прикладными математиками и программистами проблему построения быстрого алгоритма, а также его эффективной программой реализации с учетом особенностей решаемой задачи. Использование типовых решателей в составе математических библиотек общего назначения для подобных целей крайне ограниченно. Более перспективным для реализации программных приложений близкой функциональности представляется использование объектно-ориентированных каркасов. В статье предпринимается попытка систематизировать и обобщить модели и методы теории расписания с целью построения подобного каркаса. Главное внимание при этом уделяется задачам ресурсного планирования проектов, которые, с одной стороны, находят широкое практическое применение, а с другой стороны, - обобщают математические постановки, возникающие в смежных предметных областях и дисциплинах.

Об авторах

А. С. Аничкин
ИСП РАН
Россия


В. А. Семенов
ИСП РАН
Россия


Список литературы

1. Интернет-ресурс: https://ru.wikipedia.org/wiki/Теория_pасписаний (в редакции от 4 июня 2013 14:07).

2. Лазарев А. А., Гафаров Е. Р. Теория расписаний: задачи и алгоритмы. Московский государственный университет им. М.В. Ломоносова (МГУ), Москва, Россия, 2011, 222 с.

3. Коваленко Ю. В. Сложность некоторых задач теории расписаний и эволюционные алгоритмы их решения. Диссертация на соискание учёной степени кандидата физико-математических наук, Омск, Россия, 2013, 129 с.

4. Sprecher A. Resource-constrained project scheduling: Exact methods for the multi-mode case. Серия книг: Lecture Notes in Economics and Mathematical Systems, том 409, Springer, Berlin, Germany, 1994, 142 с.

5. Интернет-ресурс: https://ru.wikipedia.org/wiki/Задача_об_упаковке_в_контейнеры (в редакции от 19 сентября 2013 21:17).

6. Интернет-ресурс: https://ru.wikipedia.org/wiki/Задача_о_pюкзаке (в редакции от 29 июня 2014 07:47).

7. Stadtler H. Multilevel capacitated lot-sizing and resource-constrained project scheduling: An integrating perspective. International Journal of Production Research, 2005, том 43, выпуск 24, с. 5253-5270.

8. Интернет-ресурс: https://ru.wikipedia.org/wiki/Задача_коммивояжёра (в редакции от 21 мая 2014 18:07).

9. Brucker P., Knust S. Resource-constrained project scheduling and timetabling. Lecture Notes in Computer Science, 2001, том 2079, с. 277-293.

10. Drexl A., Salewski F. Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research, 1997, том 102, выпуск 1, с. 193-214.

11. Pritsker A. A. B., Watters L. J., Wolfe P. M. Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 1969, том 16, выпуск 1, с. 93-107.

12. Blazewicz J., Lenstra J. K., Rinnooy Kan A. H. G. Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 1983, том 5, с. 11-24.

13. Ahuja H. N. Construction performance control by networks. John Wiley & Sons, New York, USA, 1976, 636 с.

14. Davis E. W., Patterson J. H. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science, 1975, том 21, выпуск 8, с. 944-955.

15. Hegazy T. Optimization of resource allocation and leveling using genetic algorithms. Journal of Construction Engineering and Management, 1999, том 125, выпуск 3, с. 167-175.

16. Brooks G. N., White C. R. An algorithm for finding optimal or near optimal solutions to the production scheduling problem. Journal of Industrial Engineering, 1966, том 17, выпуск 2, с. 173-186.

17. Gomory R. E. An all integer programming algorithm. Глава из книги [[157]], c. 193-206.

18. Szwarg W. Solutions of the akers-friedman scheduling problem. Operations Research, 1960, том 8, выпуск 6, с. 782-788.

19. Ashour S. A Decomposition Approach for the Machine Scheduling Problem. University of Iowa, Iowa City, USA, 1967, 416 с.

20. Giffler B., Thompson G. L., Van Ness V. Numerical experience with the linear and Monte-Carlo algorithms for solving production scheduling problems. Глава из книги [[157]], c. 21-29.

21. Page E. S. An approach to the scheduling of the N jobs on M machines. Journal of the Royal Statistical Society, 1961, том 23, выпуск 2, с 484-492.

22. Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 1996, том 14, выпуск 3, с. 179-192.

23. Boctor F. F. Some efficient multi-heuristic procedures for resource constrained project scheduling. European Journal of Operational Research, 1990, том 49, выпуск 1, с. 3-13.

24. Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 1979, том 5, с. 287-326.

25. Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 1999, том 112, выпуск 1, с. 3-41.

26. Słowin´ski R. Multiobjective network scheduling with efficient use of renewable and nonrenewable resources. European Journal of Operational Research, 1981, том 7, выпуск 3, с. 265-273.

27. Weglarz J. On certain models of resource allocation problems. Kybernetes, 1980, том 9, выпуск 1, с. 61-66.

28. Böttcher J., Drexl A., Kolisch R., Salewski F. Project scheduling under partially renewable resource constraints. Management Science, 1999, том 45, выпуск 4, с. 543-559.

29. Zhu G., Bard J. F., Yu G. A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. INFORMS Journal on Computing, 2006, том 18, выпуск 3, с. 377-390.

30. Nudtasomboon N., Randhawa S. U. Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs. Computers and Industrial Engineering, 1997, том 32, выпуск 1, с. 227-242.

31. Neumann K., Schwindt C. Project scheduling with inventory constraints. Mathematical Methods of Operations Research, 2003, том 56, выпуск 3, с. 513-533.

32. Bartels J. H., Zimmermann J. Scheduling tests in automotive R&D projects. European Journal of Operational Research, 2009, том 193, выпуск 3, с. 805-819.

33. Schwindt C., Trautmann N. Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spectrum, 2000, том 22, выпуск 4, с. 501-524.

34. Neumann K., Schwindt C., Trautmann N. Scheduling of continuous and discontinuous material flows with intermediate storage restrictions. European Journal of Operational Research, 2005, том 165, выпуск 2, с. 495-509.

35. Weglarz J., Blazewicz J., Cellary W., Słowin´ski R. Algorithm 520: An automatic revised simplex method for constrained resource network scheduling. ACM Transactions on Mathematical Software, 1977, том 3, выпуск 3, с. 295-300.

36. Blazewicz J., Ecker K., Pesch E., Schmidt G., Weglarz J. Handbook on Scheduling: From Theory to Applications. Серия книг: International Handbooks on Information Systems, Springer, Berlin, Germany, 2007, 647 с.

37. Kis T. A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Mathematical Programming, 2005, том 103, выпуск 3, с. 515-539.

38. Waligora G. Discrete-continuous project scheduling with discounted cash flows - A tabu search approach. Computers and Operations Research, 2008, том 35, выпуск 7, с. 2141-2153.

39. Kis T. RCPS with Variable intensity activities and feeding precedence constraints. Глава из книги [[158]], с. 105-129.

40. Jozefowska J., Mika M., Rozycki R., Waligora G., Weglarz J. Solving the discrete-continuous project scheduling problem via its discretization. Mathematical Methods of Operations Research, 2000, том 52, выпуск 3, с. 489-499.

41. Weglarz J. Project scheduling with continuously divisible, doubly-constrained resources. Management Science, 1981, том 27, выпуск 9, с. 1040-1053.

42. Bianco L., Dell’olmo P., Speranza M. G. Heuristics for multimode scheduling problems with dedicated resources. European Journal of Operational Research, 1998, том 107, выпуск 2, с. 260-271.

43. Bianco L., Caramia M., Dell’olmo P. Solving a preemptive project scheduling problem with coloring techniques. Глава из книги [[159]], с. 135-146.

44. Dorndorf U., Phan-Huy T., Pesch E. A survey of interval capacity consistency tests for time- and resource constrained scheduling. Глава из книги [[159]], с. 213-238.

45. Dorndorf U., Pesch E., Phan-Huy T. Constraint propagation techniques for the disjunctive scheduling problem. Artificial Intelligence, 2000, том 122, выпуск 1-2, с. 189-240.

46. Bomsdorf F., Derigs U. A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem. OR-Spectrum, 2008, том 30, выпуск 4, с. 751-772.

47. Klein R., Scholl A. Scattered branch and bound - An adaptive search strategy applied to resource-constrained project scheduling. Central European Journal of Operations Research, 1999, том 7, с. 177-201.

48. Nonobe K., Ibaraki T. Formulation and tabu search algorithm for the resource constrained project scheduling problem. Глава (с. 557-588) из книги под ред. Ribeiro C. C., Hansen P. Essays and Surveys in Metaheuristics. Серия книг: Operations Research/Computer Science Interfaces Series, том 15, Springer, Berlin, Germany, 2002, 664 с.

49. Pesch E. Lower bounds in different problem classes of project schedules with resource constraints. Глава из книги [[159]], с. 53-76.

50. Klein R., Scholl A. Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research, 1999, том 112, выпуск 2, с. 322-346.

51. Klein R. Project scheduling with time-varying resource constraints. International Journal of Production Research, 2000, том 38, выпуск 16, с. 3937-3952.

52. Hartmann S. Project scheduling under limited resources: Models, methods, and applications. Серия книг: Lecture Notes in Economics and Mathematical Systems, том 478, Springer, Berlin, Germany, 1999, 221 с.

53. Icmeli O., Rom W. O. Solving the resource constrained project scheduling problem with optimization subroutine library. Computers and Operations Research, 1996, том 23, выпуск 8, с. 801-817.

54. Bartusch M., Möhring R. H., Radermacher F. J. Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 1988, том 16, выпуск 1, с. 201-240.

55. Debels D., Vanhoucke M. The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Computers and Industrial Engineering, 2008, том 54, выпуск 1, с. 140-154.

56. Demeulemeester E. L., Herroelen W. S. An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Operational Research, 1996, том 90, выпуск 2, с. 334-348.

57. Ballestin F., Valls V., Quintanilla S. Pre-emption in resource-constrained project scheduling. European Journal of Operational Research, 2008, том 189, выпуск 3, с. 1136-1152.

58. Buddhakulsomsiria J., Kim D. S. Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, 2006, том 175, выпуск 1, с. 279-295.

59. Buddhakulsomsiria J., Kim D. S. Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, 2007, том 178, выпуск 2, с. 374-390.

60. Franck B., Neumann K., Schwindt C. Project scheduling with calendars. OR Spektrum, 2001, том 23, выпуск 3, с. 325-334.

61. Drezet L. E., Billaut J. C. A project scheduling problem with labour constraints and time-dependent activities requirements. International Journal of Production Economics, 2008, том 112, выпуск 1, с. 217-225.

62. Cavalcante C. C. B., C. de Souza C., Savelsbergh M. W. P., Wang Y., Wolsey L. A. Scheduling projects with labor constraints. Discrete Applied Mathematics, 2001, том 112, выпуск 1-3, с. 27-52.

63. Mika M., Waligora G., Weglarz J. Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research, 2008, том 187, выпуск 3, с. 1238-1250.

64. Mika M., Waligоra G., Weglarz J. Modelling setup times in project scheduling. Глава из книги [[158]], с. 131-165.

65. Drexl A., Nissen R., Patterson J. H., Salewski F. Progen/πx - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. European Journal of Operational Research, 2000, том 125, выпуск 1, с. 59-72.

66. Vanhoucke M. Setup times and fast tracking in resource-constrained project scheduling. Computers and Industrial Engineering, 2008, том 54, выпуск 4, с. 1062-1070.

67. Elmaghraby S. E. Activity networks: Project planning and control by network models. Wiley, New York, USA, 1977, 443 с.

68. Alcaraz J., Maroto C., Ruiz R. Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society, 2003, том 54, выпуск 6, с. 614-626.

69. Bouleimen K., Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research, 2003, том 149, выпуск 2, с. 268-281.

70. Hartmann S. Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, 2001, том 102, выпуск 1-4, с. 111-135.

71. Jarboui B., Damak N., Siarry P., Rebai A. A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation, 2008, том 195, выпуск 1, с. 299-308.

72. Jozefowska J., Mika M., Rozycki R., Waligora G., Weglarz J. Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research, 2001, том 102, выпуск 1-4, с. 137-155.

73. Özdamar L. A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 1999, том 29, выпуск 1, с. 44-59.

74. Calhoun K. M., Deckro R. F., Moore J. T., Chrissis J. W., Hove J. C. V. Planning and re-planning in project and production scheduling. Omega, 2002, том 30, выпуск 3, с. 155-170.

75. B. de Reyck, Herroelen W. S. The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 1999, том 119, выпуск 2, с. 538-556.

76. Heilmann R. Resource-constrained project scheduling: A heuristic for the multi-mode case. OR Spektrum, 2001, том 23, выпуск 3, с. 335-357.

77. Heilmann R. A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research, 2003, том 144, выпуск 2, с. 348-365.

78. Li H., Womer K. Modeling the supply chain configuration problem with resource constraints. International Journal of Project Management, 2008, том 26, выпуск 6, с. 646-654.

79. Tiwari V., Patterson J. H., Mabert V. A. Scheduling projects with heterogeneous resources to meet time and quality objectives. European Journal of Operational Research, 2009, том 193, выпуск 3, с. 780-790.

80. Tareghian H. R., Taheri S. H. A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search. Applied Mathematics and Computation, 2007, том 190, выпуск 2, с. 1136-1145.

81. Salewski F., Schirmer A., Drexl A. Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application. European Journal of Operational Research, 1997, том 102, выпуск 1, с. 88-110.

82. Demeulemeester E. L., B. de Reyck, Herroelen W. S. The discrete time/resource trade-off problem in project networks - A branch-and-bound approach. IIE Transactions, 2000, том 32, выпуск 11, с. 1059-1069.

83. Ranjbar M., Kianfar F. Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms. Applied Mathematics and Computation, 2007, том 191, выпуск 2, с. 451-456.

84. Ranjbar M., B. de Reyck, Kianfar F. A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. European Journal of Operational Research, 2009, том 193, выпуск 1, с. 35-48.

85. Akkan C., Drexl A., Kimms A. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research, 2005, том 165, выпуск 2, с. 339-358.

86. Demeulemeester E. L., B. de Reyck, Foubert B., Herroelen W. S., Vanhoucke M. New computational results on the discrete time/cost trade-off problem in project networks. Journal of the Operational Research Society, 1998, том 49, выпуск 11, с. 1153-1163.

87. Deckro R. F., Hebert J. E., Verdini W. A., Grimsrud P. H., Venkateshwar S. Nonlinear time/cost tradeoff models in project management. Computers and Industrial Engineering, 1995, том 28, выпуск 2, с. 219-229.

88. Chassiakos A. P., Sakellaropoulos S. P. Time-cost optimization of construction projects with generalized activity constraints. Journal of Construction Engineering and Management, 2005, том 131, выпуск 10, с. 1115-1124.

89. Klein R., Scholl A. PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem. Mathematical Methods of Operations Research, 2000, том 52, выпуск 3, с. 467-488.

90. Kolisch R. Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies. International Journal of Production Economics, 2000, том 64, выпуск 1-3, с. 127-141.

91. Vanhoucke M. Work continuity constraints in project scheduling. Journal of Construction Engineering and Management, 2006, том 132, выпуск 1, с. 14-25.

92. Demeulemeester E. L., Herroelen W. S. Modelling setup times, process batches and transfer batches using activity network logic. European Journal of Operational Research, 1996, том 89, выпуск 2, с. 355-365.

93. Cesta A., Oddi A., Smith S. F. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 2002, том 8, выпуск 1, с. 109-136.

94. Dorndorf U., Pesch E., Phan Huy T. A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints. Management Science, 2000, том 46, выпуск 10, с. 1365-1384.

95. Schwindt C. Generation of resource-constrained project scheduling problems subject to temporal constraints. Technical Report WIOR-543, Universität Karlsruhe, Germany, 1998.

96. Neumann K., Zimmermann J. Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Central European Journal of Operations Research, 2002, том 10, выпуск 4, с. 357-380.

97. Neumann K., Zimmermann J. Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research, 2000, том 127, выпуск 2, с. 425-443.

98. Neumann K., Schwindt C., Zimmermann J. Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications. Central European Journal of Operations Research, 2002, том 10, выпуск 2, с. 113-148.

99. Sabzehparvar M., Seyed-Hosseini S. M. A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. Journal of Supercomputing, 2008, том 44, выпуск 3, с. 257-273.

100. Franck B., Neumann K. Resource-constrained project scheduling with time windows: Structural questions and priority rule methods. Technical Report WIOR-492, Universität Karlsruhe, Germany, 1997.

101. Ballestin F., Valls V., Quintanilla S. Due dates and RCPSP. Глава из книги [[158]], с. 79-104.

102. Brânzei R., Ferrari G., Fragnelli V., Tijs S. Two approaches to the problem of sharing delay costs in joint projects. Annals of Operations Research, 2002, том 109, выпуск 1-4, с. 359-374.

103. Chiu H. N., Tsai D. M. An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows. Construction Management and Economics, 2002, том 20, выпуск 1, с. 55-66.

104. Özdamar L., Ulusoy G., Bayyigit M. A heuristic treatment of tardiness and net present value criteria in resource constrained project scheduling. International Journal of Physical Distribution and Logistics Management, 1998, том 28, выпуск 9/10, с. 805-824.

105. Baptiste P., Pape C. L., Nuijten W. Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 1999, том 92, с. 305-333.

106. Yang H. H., Chen Y. L. Finding the critical path in an activity network with time-switch constraints. European Journal of Operational Research, 2000, том 120, выпуск 3, с. 603-613.

107. Vanhoucke M., Demeulemeester E. L., Herroelen W. S. Discrete time/cost trade-offs in project scheduling with time-switch constraints. Journal of the Operational Research Society, 2002, том 53, выпуск 7, с. 741-751.

108. Krüger D., Scholl A. Managing and modelling general resource transfers in (multi-)project scheduling. OR Spektrum, 2010, том 32, выпуск 2, с. 369-394.

109. Elmaghraby S. E. An algebra for the analysis of generalized activity networks. Management Science, 1964, том 10, выпуск 3, с. 494-514.

110. Belhe U., Kusiak A. Resource-constrained scheduling of hierarchically structured design activity networks. IEEE Transactions on Engineering Management, 1995, том 42, выпуск 2, с. 150-158.

111. Neumann K. Stochastic project networks: Temporal analysis, scheduling and cost minimization. Серия книг: Lecture Notes in Economics and Mathematical Systems, том 344, Springer, Berlin, Germany, 1990, 237 с.

112. Kuster J., Jannach D. Handling airport ground processes based on resource-constrained project scheduling. Lecture Notes in Computer Science, 2006, том 4031, с. 166-176.

113. Viana A., P. de Sousa J. Using metaheuristics in multiobjective resource constrained project scheduling. European Journal of Operational Research, 2000, том 120, выпуск 2, с. 359-374.

114. Vanhoucke M., Demeulemeester E. L., Herroelen W. S. An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research, 2001, том 102, выпуск 1-4, с. 179-196.

115. Franck B., Schwindt C. Different resource-constrained project scheduling models with minimal and maximal time-lags. Technical Report WIOR-450, Universität Karlsruhe, Germany, 1995.

116. Lorenzoni L. L., Ahonen H., G. de Alvarenga A. A multi-mode resource-constrained scheduling problem in the context of port operations. Computers and Industrial Engineering, 2006, том 50, выпуск 1-2, с. 55-65.

117. Vanhoucke M. Scheduling an R&D project with quality-dependent time slots. Lecture Notes in Computer Science, 2006, том 3982, с. 621-630.

118. Rom W. O., Tukel O. I., Muscatello J. R. MRP in a job shop environment using a resource constrained project scheduling model. Omega, 2002, том 30, выпуск 4, с. 275-286.

119. Nazareth T., Verma S., Bhattacharya S., Bagchi A. The multiple resource constrained project scheduling problem: A breadth-first approach. European Journal of Operational Research, 1999, том 112, выпуск 2, с. 347-366.

120. Al-Fawzan M., Haouari M. A bi-objective model for robust resource-constrained project scheduling. International Journal of Production Economics, 2005, том 96, выпуск 2, с. 175-187.

121. Abbasi B., Shadrokh S., Arkat J. Bi-objective resource-constrained project scheduling with robustness and makespan criteria. Applied Mathematics and Computation, 2006, том 180, выпуск 1, с. 146-152.

122. Kobylanski P., Kuchta D. A note on the paper by M. A. Al-Fawzan and M. Haouari about a bi-objective problem for robust resource-constrained project scheduling. International Journal of Production Economics, 2007, том 107, выпуск 2, с. 496-501.

123. Chtourou H., Haouari M. A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling. Computers and Industrial Engineering, 2008, том 55, выпуск 1, с. 183-194.

124. Icmeli-Tukel O., Rom W. O. Ensuring quality in resource constrained project scheduling. European Journal of Operational Research, 1997, том 103, выпуск 3, с. 483-496.

125. Van de Vonder S., Demeulemeester E. L., Herroelen W. S. A classification of predictive-reactive project scheduling procedures. Journal of Scheduling, 2007, том 10, выпуск 3, с. 195-207.

126. Sakkout H., Wallace M. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 2000, том 5, выпуск 4, с. 359-388.

127. Zhu G., Bard J. F., Yu G. Disruption management for resource-constrained project scheduling. Journal of the Operational Research Society, 2005, том 56, с. 365-381.

128. Neumann K., Schwindt C., Zimmermann J. Resource-constrained project scheduling with time windows: Recent developments and new applications. Глава из книги [[158]], с. 375-407.

129. Drexl A., Kimms A. Optimization guided lower and upper bounds for the resource investment problem. Journal of the Operational Research Society, 2001, том 52, выпуск 3, с. 340-351.

130. Ranjbar M., Kianfar F., Shadrokh S. Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Applied Mathematics and Computation, 2008, том 196, выпуск 2, с. 879-888.

131. Yamashita D. S., Armentano V. A., Laguna M. Robust optimization models for project scheduling with resource availability cost. Journal of Scheduling, 2007, том 10, выпуск 1, с. 67-76.

132. Shadrokh S., Kianfar F. A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. European Journal of Operational Research, 2007, том 181, выпуск 1, с. 86-101.

133. Nübel H. The resource renting problem subject to temporal constraints. OR-Spektrum, 2001, том 23, выпуск 3, с. 359-381.

134. Ballestin F. A genetic algorithm for the resource renting problem with minimum and maximum time lags. Lecture Notes in Computer Science, 2007, том 4446, с. 25-35.

135. Bandelloni M., Tucci M., Rinaldi R. Optimal resource leveling using non-serial dynamic programming. European Journal of Operational Research, 1994, том 78, выпуск 2, с. 162-177.

136. Davis K. R., Stam A., Grzybowski R. A. Resource constrained project scheduling with multiple objectives: A decision support approach. Computers and Operations Research, 1992, том 19, выпуск 7, с. 657-669.

137. Maniezzo V., Mingozzi A. The project scheduling problem with irregular starting time costs. Operations Research Letters, 1999, том 25, выпуск 4, с. 175-182.

138. Möhring R. H., Schulz A. S., Stork F., Uetz M. On project scheduling with irregular starting time costs. Operations Research Letters, 2001, том 28, выпуск 4, с. 149-154.

139. Möhring R. H., Schulz A. S., Stork F., Uetz M. Solving project scheduling problems by minimum cut computations. Management Science, 2003, том 49, выпуск 3, с. 330-350.

140. Achuthan N., Hardjawidjaja A. Project scheduling under time dependent costs - A branch and bound algorithm. Annals of Operations Research, 2001, том 108, выпуск 1-4, с. 55-74.

141. Dodin B., Elimam A. A. Integrated project scheduling and material planning with variable activity duration and rewards. IIE Transactions, 2001, том 33, выпуск 11, с. 1005-1018.

142. Nonobe K., Ibaraki T. A metaheuristic approach to the resource constrained project scheduling with variable activity durations and convex cost functions. Глава из книги [[158]], с. 225-248.

143. Rummel J. L., Walter Z., Dewan R., Seidmann A. Activity consolidation to improve responsiveness. European Journal of Operational Research, 2005, том 161, выпуск 3, с. 683-703.

144. Kimms A. Maximizing the net present value of a project under resource constraints using a lagrangian relaxation based heuristic with tight upper bounds. Annals of Operations Research, 2001, том 102, выпуск 1-4, с. 221-236.

145. Mika M., Waligora G., Weglarz J. Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, 2005, том 164, выпуск 3, с. 639-668.

146. Padman R., Zhu D. Knowledge integration using problem spaces: A study in resource-constrained project scheduling. Journal of Scheduling, 2006, том 9, выпуск 2, с. 133-152.

147. Vanhoucke M., Demeulemeester E. L., Herroelen W. S. On maximizing the net present value of a project under renewable resource constraints. Management Science, 2001, том 47, выпуск 8, с. 1113-1121.

148. Varma V. A., Uzsoy R., Pekny J., Blau G. Lagrangian heuristics for scheduling new product development projects in the pharmaceutical industry. Journal of Heuristics, 2007, том 13, выпуск 5, с. 403-433.

149. Najafi A. A., Niaki S. T. A. A genetic algorithm for resource investment problem with discounted cash flows. Applied Mathematics and Computation, 2006, том 183, выпуск 2, с. 1057-1070.

150. Herroelen W. S., P. van Dommelen, Demeulemeester E. L. Project network models with discounted cash flows: A guided tour through recent developments. European Journal of Operational Research, 1997, том 100, выпуск 1, с. 97-121.

151. Dayanand N., Padman R. On modelling payments in projects. Journal of the Operational Research Society, 1997, том 48, выпуск 9, с. 906-918.

152. Etgar R., Shtub A., LeBlanc L. J. Scheduling projects to maximize net present value - the case of time-dependent, contingent cash flows. European Journal of Operational Research, 1997, том 96, выпуск 1, с. 90-96.

153. Hapke M., Jaszkiewicz A., Slowinski R. Interactive analysis of multiple-criteria project scheduling problems. European Journal of Operational Research, 1998, том 107, выпуск 2, с. 315-324.

154. Slowinski R., Soniewicki B., Weglarz J. DSS for multiobjective project scheduling. European Journal of Operational Research, 1994, том 79, выпуск 2, с. 220-229.

155. Dörner K. F., Gutjahr W. J., Hartl R. F., Strauss C., Stummer C. Nature-inspired metaheuristics for multiobjective activity crashing. Omega, 2008, том 36, выпуск 6, с. 1019-1037.

156. Nabrzynski J., Weglarz J. Knowledge-based multiobjective project scheduling problems. Глава из книги [[159]], с. 383-411.

157. Под ред. Muth J. F., Thompson G. L. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, New Jersey, USA, 1963, 467 с.

158. Под ред. Jozefowska J., Weglarz J. Perspectives in Modern Project Scheduling. Springer Science & Business Media, New York, USA, 2006, 466 с.

159. Под ред. Weglarz J. Project Scheduling: Recent Models, Algorithms and Applications. Springer, New York, USA, 1999, 535 с.

160. Internet page: https://ru.wikipedia.org/wiki/%D0%A2%D0%B5%D0%BE%D1%80%D0 %B8%D1%8F_%D1%80%D0%B0%D1%81%D0%BF%D0%B8%D1%81%D0%B0%D0%BD%D0%B8%D0%B9 (as amended June 4, 2013 at 14:07).

161. Lazarev A. A., Gafarov E. R. Teoriya raspisanij: zadachi i algoritmy [Scheduling theory: problems and algorithms]. Lomonosov Moscow State University, Moscow, Russia, 2011, 222 p.

162. Kovalenko YU. V. Slozhnost' nekotorykh zadach teorii raspisanij i ehvolyutsionnye algoritmy ikh resheniya [Complexity of some scheduling problems and evolutionary algorithms for their solution]. PhD thesis, Omsk, Russia, 2013, 129 p.

163. Sprecher A. Resource-constrained project scheduling: Exact methods for the multi-mode case. Series: Lecture Notes in Economics and Mathematical Systems, vol. 409, Springer, Berlin, Germany, 1994, 142 p.

164. Internet page: https://ru.wikipedia.org/wiki/%D0%97%D0%B0%D0%B4%D0%B0%D1 %87%D0%B0_%D0%BE%D0%B1_%D1%83%D0%BF%D0%B0%D0%BA%D0%BE%D0%B2%D0%BA%D0%B5_%D0%B2_%D0%BA%D0%BE%D0%BD%D1%82%D0%B5%D0%B9%D0%BD%D0%B5%D1%80%D1%8B (as amended September 19, 2013 at 21:17).

165. Internet page: https://ru.wikipedia.org/wiki/%D0%97%D0%B0%D0%B4%D0%B0%D1 %87%D0%B0_%D0%BE_%D1%80%D0%B0%D0%BD%D1%86%D0%B5 (as amended June 29, 2014 at 07:47).

166. Stadtler H. Multilevel capacitated lot-sizing and resource-constrained project scheduling: An integrating perspective. International Journal of Production Research, 2005, vol. 43, no. 24, pp. 5253-5270.

167. Internet page: https://ru.wikipedia.org/wiki/%D0%97%D0%B0%D0%B4%D0%B0%D1 %87%D0%B0_%D0%BA%D0%BE%D0%BC%D0%BC%D0%B8%D0%B2%D0%BE%D1%8F%D0%B6%D1%91%D1%80%D0%B0 (as amended May 21, 2014 at 18:07).

168. Brucker P., Knust S. Resource-constrained project scheduling and timetabling. Lecture Notes in Computer Science, 2001, vol. 2079, pp. 277-293.

169. Drexl A., Salewski F. Distribution requirements and compactness constraints in school timetabling. European Journal of Operational Research, 1997, vol. 102, no. 1, pp. 193-214.

170. Pritsker A. A. B., Watters L. J., Wolfe P. M. Multiproject scheduling with limited resources: A zero-one programming approach. Management Science, 1969, vol. 16, no. 1, pp. 93-107.

171. Blazewicz J., Lenstra J. K., Rinnooy Kan A. H. G. Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics, 1983, vol. 5, pp. 11-24.

172. Ahuja H. N. Construction performance control by networks. John Wiley & Sons, New York, USA, 1976, 636 p.

173. Davis E. W., Patterson J. H. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science, 1975, vol. 21, no. 8, pp. 944-955.

174. Hegazy T. Optimization of resource allocation and leveling using genetic algorithms. Journal of Construction Engineering and Management, 1999, vol. 125, no. 3, pp. 167-175.

175. Brooks G. N., White C. R. An algorithm for finding optimal or near optimal solutions to the production scheduling problem. Journal of Industrial Engineering, 1966, vol. 17, no. 2, pp. 173-186.

176. Gomory R. E. An all integer programming algorithm. Chapter from book [[157]], pp. 193-206.

177. Szwarg W. Solutions of the akers-friedman scheduling problem. Operations Research, 1960, vol. 8, no. 6, pp. 782-788.

178. Ashour S. A Decomposition Approach for the Machine Scheduling Problem. University of Iowa, Iowa City, USA, 1967, 416 p.

179. Giffler B., Thompson G. L., Van Ness V. Numerical experience with the linear and Monte-Carlo algorithms for solving production scheduling problems. Chapter from book [[157]], pp. 21-29.

180. Page E. S. An approach to the scheduling of the N jobs on M machines. Journal of the Royal Statistical Society, 1961, vol. 23, no. 2, pp. 484-492.

181. Kolisch R. Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 1996, vol. 14, no. 3, pp. 179-192.

182. Boctor F. F. Some efficient multi-heuristic procedures for resource constrained project scheduling. European Journal of Operational Research, 1990, vol. 49, no. 1, pp. 3-13.

183. Graham R. L., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 1979, vol. 5, pp. 287-326.

184. Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 1999, vol. 112, no. 1, pp. 3-41.

185. Słowin´ski R. Multiobjective network scheduling with efficient use of renewable and nonrenewable resources. European Journal of Operational Research, 1981, vol. 7, no. 3, pp. 265-273.

186. Weglarz J. On certain models of resource allocation problems. Kybernetes, 1980, vol. 9, no. 1, pp. 61-66.

187. Böttcher J., Drexl A., Kolisch R., Salewski F. Project scheduling under partially renewable resource constraints. Management Science, 1999, vol. 45, no. 4, pp. 543-559.

188. Zhu G., Bard J. F., Yu G. A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. INFORMS Journal on Computing, 2006, vol. 18, no. 3, pp. 377-390.

189. Nudtasomboon N., Randhawa S. U. Resource-constrained project scheduling with renewable and non-renewable resources and time-resource tradeoffs. Computers and Industrial Engineering, 1997, vol. 32, no. 1, pp. 227-242.

190. Neumann K., Schwindt C. Project scheduling with inventory constraints. Mathematical Methods of Operations Research, 2003, vol. 56, no. 3, pp. 513-533.

191. Bartels J. H., Zimmermann J. Scheduling tests in automotive R&D projects. European Journal of Operational Research, 2009, vol. 193, no. 3, pp. 805-819.

192. Schwindt C., Trautmann N. Batch scheduling in process industries: An application of resource-constrained project scheduling. OR Spectrum, 2000, vol. 22, no. 4, pp. 501-524.

193. Neumann K., Schwindt C., Trautmann N. Scheduling of continuous and discontinuous material flows with intermediate storage restrictions. European Journal of Operational Research, 2005, vol. 165, no. 2, pp. 495-509.

194. Weglarz J., Blazewicz J., Cellary W., Słowin´ski R. Algorithm 520: An automatic revised simplex method for constrained resource network scheduling. ACM Transactions on Mathematical Software, 1977, vol. 3, no. 3, pp. 295-300.

195. Blazewicz J., Ecker K., Pesch E., Schmidt G., Weglarz J. Handbook on Scheduling: From Theory to Applications. Series: International Handbooks on Information Systems, Springer, Berlin, Germany, 2007, 647 p.

196. Kis T. A branch-and-cut algorithm for scheduling of projects with variable-intensity activities. Mathematical Programming, 2005, vol. 103, no. 3, pp. 515-539.

197. Waligora G. Discrete-continuous project scheduling with discounted cash flows - A tabu search approach. Computers and Operations Research, 2008, vol. 35, no. 7, pp. 2141-2153.

198. Kis T. RCPS with Variable intensity activities and feeding precedence constraints. Chapter from book [[158]], pp. 105-129.

199. Jozefowska J., Mika M., Rozycki R., Waligora G., Weglarz J. Solving the discrete-continuous project scheduling problem via its discretization. Mathematical Methods of Operations Research, 2000, vol. 52, no. 3, pp. 489-499.

200. Weglarz J. Project scheduling with continuously divisible, doubly-constrained resources. Management Science, 1981, vol. 27, no. 9, pp. 1040-1053.

201. Bianco L., Dell’olmo P., Speranza M. G. Heuristics for multimode scheduling problems with dedicated resources. European Journal of Operational Research, 1998, vol. 107, no. 2, pp. 260-271.

202. Bianco L., Caramia M., Dell’olmo P. Solving a preemptive project scheduling problem with coloring techniques. Chapter from book [[159]], pp. 135-146.

203. Dorndorf U., Phan-Huy T., Pesch E. A survey of interval capacity consistency tests for time- and resource constrained scheduling. Chapter from book [[159]], pp. 213-238.

204. Dorndorf U., Pesch E., Phan-Huy T. Constraint propagation techniques for the disjunctive scheduling problem. Artificial Intelligence, 2000, vol. 122, no. 1-2, pp. 189-240.

205. Bomsdorf F., Derigs U. A model, heuristic procedure and decision support system for solving the movie shoot scheduling problem. OR-Spectrum, 2008, vol. 30, no. 4, pp. 751-772.

206. Klein R., Scholl A. Scattered branch and bound - An adaptive search strategy applied to resource-constrained project scheduling. Central European Journal of Operations Research, 1999, vol. 7, pp. 177-201.

207. Nonobe K., Ibaraki T. Formulation and tabu search algorithm for the resource constrained project scheduling problem. Chapter (pp. 557-588) from book Ribeiro C. C., Hansen P. (eds.) Essays and Surveys in Metaheuristics. Series: Operations Research/Computer Science Interfaces Series, vol. 15, Springer, Berlin, Germany, 2002, 664 p.

208. Pesch E. Lower bounds in different problem classes of project schedules with resource constraints. Chapter from book [[159]], pp. 53-76.

209. Klein R., Scholl A. Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research, 1999, vol. 112, no. 2, pp. 322-346.

210. Klein R. Project scheduling with time-varying resource constraints. International Journal of Production Research, 2000, vol. 38, no. 16, pp. 3937-3952.

211. Hartmann S. Project scheduling under limited resources: Models, methods, and applications. Series: Lecture Notes in Economics and Mathematical Systems, vol. 478, Springer, Berlin, Germany, 1999, 221 p.

212. Icmeli O., Rom W. O. Solving the resource constrained project scheduling problem with optimization subroutine library. Computers and Operations Research, 1996, vol. 23, no. 8, pp. 801-817.

213. Bartusch M., Möhring R. H., Radermacher F. J. Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 1988, vol. 16, no. 1, pp. 201-240.

214. Debels D., Vanhoucke M. The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Computers and Industrial Engineering, 2008, vol. 54, no. 1, pp. 140-154.

215. Demeulemeester E. L., Herroelen W. S. An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. European Journal of Operational Research, 1996, vol. 90, no. 2, pp. 334-348.

216. Ballestin F., Valls V., Quintanilla S. Pre-emption in resource-constrained project scheduling. European Journal of Operational Research, 2008, vol. 189, no. 3, pp. 1136-1152.

217. Buddhakulsomsiria J., Kim D. S. Properties of multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, 2006, vol. 175, no. 1, pp. 279-295.

218. Buddhakulsomsiria J., Kim D. S. Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting. European Journal of Operational Research, 2007, vol. 178, no. 2, pp. 374-390.

219. Franck B., Neumann K., Schwindt C. Project scheduling with calendars. OR Spektrum, 2001, vol. 23, no. 3, pp. 325-334.

220. Drezet L. E., Billaut J. C. A project scheduling problem with labour constraints and time-dependent activities requirements. International Journal of Production Economics, 2008, vol. 112, no. 1, pp. 217-225.

221. Cavalcante C. C. B., pp. de Souza C., Savelsbergh M. W. P., Wang Y., Wolsey L. A. Scheduling projects with labor constraints. Discrete Applied Mathematics, 2001, vol. 112, no. 1-3, pp. 27-52.

222. Mika M., Waligora G., Weglarz J. Tabu search for multi-mode resource-constrained project scheduling with schedule-dependent setup times. European Journal of Operational Research, 2008, vol. 187, no. 3, pp. 1238-1250.

223. Mika M., Waligora G., Weglarz J. Modelling setup times in project scheduling. Chapter from book [[158]], pp. 131-165.

224. Drexl A., Nissen R., Patterson J. H., Salewski F. Progen/πx - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions. European Journal of Operational Research, 2000, vol. 125, no. 1, pp. 59-72.

225. Vanhoucke M. Setup times and fast tracking in resource-constrained project scheduling. Computers and Industrial Engineering, 2008, vol. 54, no. 4, pp. 1062-1070.

226. Elmaghraby S. E. Activity networks: Project planning and control by network models. Wiley, New York, USA, 1977, 443 p.

227. Alcaraz J., Maroto C., Ruiz R. Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society, 2003, vol. 54, no. 6, pp. 614-626.

228. Bouleimen K., Lecocq H. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research, 2003, vol. 149, no. 2, pp. 268-281.

229. Hartmann S. Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, 2001, vol. 102, no. 1-4, pp. 111-135.

230. Jarboui B., Damak N., Siarry P., Rebai A. A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Applied Mathematics and Computation, 2008, vol. 195, no. 1, pp. 299-308.

231. Jozefowska J., Mika M., Rozycki R., Waligora G., Weglarz J. Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research, 2001, vol. 102, no. 1-4, pp. 137-155.

232. Özdamar L. A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 1999, vol. 29, no. 1, pp. 44-59.

233. Calhoun K. M., Deckro R. F., Moore J. T., Chrissis J. W., Hove J. C. V. Planning and re-planning in project and production scheduling. Omega, 2002, vol. 30, no. 3, pp. 155-170.

234. B. de Reyck, Herroelen W. S. The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research, 1999, vol. 119, no. 2, pp. 538-556.

235. Heilmann R. Resource-constrained project scheduling: A heuristic for the multi-mode case. OR Spektrum, 2001, vol. 23, no. 3, pp. 335-357.

236. Heilmann R. A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research, 2003, vol. 144, no. 2, pp. 348-365.

237. Li H., Womer K. Modeling the supply chain configuration problem with resource constraints. International Journal of Project Management, 2008, vol. 26, no. 6, pp. 646-654.

238. Tiwari V., Patterson J. H., Mabert V. A. Scheduling projects with heterogeneous resources to meet time and quality objectives. European Journal of Operational Research, 2009, vol. 193, no. 3, pp. 780-790.

239. Tareghian H. R., Taheri S. H. A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search. Applied Mathematics and Computation, 2007, vol. 190, no. 2, pp. 1136-1145.

240. Salewski F., Schirmer A., Drexl A. Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application. European Journal of Operational Research, 1997, vol. 102, no. 1, pp. 88-110.

241. Demeulemeester E. L., B. de Reyck, Herroelen W. S. The discrete time/resource trade-off problem in project networks - A branch-and-bound approach. IIE Transactions, 2000, vol. 32, no. 11, pp. 1059-1069.

242. Ranjbar M., Kianfar F. Solving the discrete time/resource trade-off problem in project scheduling with genetic algorithms. Applied Mathematics and Computation, 2007, vol. 191, no. 2, pp. 451-456.

243. Ranjbar M., B. de Reyck, Kianfar F. A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. European Journal of Operational Research, 2009, vol. 193, no. 1, pp. 35-48.

244. Akkan C., Drexl A., Kimms A. Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. European Journal of Operational Research, 2005, vol. 165, no. 2, pp. 339-358.

245. Demeulemeester E. L., B. de Reyck, Foubert B., Herroelen W. S., Vanhoucke M. New computational results on the discrete time/cost trade-off problem in project networks. Journal of the Operational Research Society, 1998, vol. 49, no. 11, pp. 1153-1163.

246. Deckro R. F., Hebert J. E., Verdini W. A., Grimsrud P. H., Venkateshwar S. Nonlinear time/cost tradeoff models in project management. Computers and Industrial Engineering, 1995, vol. 28, no. 2, pp. 219-229.

247. Chassiakos A. P., Sakellaropoulos S. P. Time-cost optimization of construction projects with generalized activity constraints. Journal of Construction Engineering and Management, 2005, vol. 131, no. 10, pp. 1115-1124.

248. Klein R., Scholl A. PROGRESS: Optimally solving the generalized resource-constrained project scheduling problem. Mathematical Methods of Operations Research, 2000, vol. 52, no. 3, pp. 467-488.

249. Kolisch R. Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies. International Journal of Production Economics, 2000, vol. 64, no. 1-3, pp. 127-141.

250. Vanhoucke M. Work continuity constraints in project scheduling. Journal of Construction Engineering and Management, 2006, vol. 132, no. 1, pp. 14-25.

251. Demeulemeester E. L., Herroelen W. S. Modelling setup times, process batches and transfer batches using activity network logic. European Journal of Operational Research, 1996, vol. 89, no. 2, pp. 355-365.

252. Cesta A., Oddi A., Smith S. F. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 2002, vol. 8, no. 1, pp. 109-136.

253. Dorndorf U., Pesch E., Phan Huy T. A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints. Management Science, 2000, vol. 46, no. 10, pp. 1365-1384.

254. Schwindt C. Generation of resource-constrained project scheduling problems subject to temporal constraints. Technical Report WIOR-543, Universität Karlsruhe, Germany, 1998.

255. Neumann K., Zimmermann J. Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints. Central European Journal of Operations Research, 2002, vol. 10, no. 4, pp. 357-380.

256. Neumann K., Zimmermann J. Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operational Research, 2000, vol. 127, no. 2, pp. 425-443.

257. Neumann K., Schwindt C., Zimmermann J. Recent results on resource-constrained project scheduling with time windows: Models, solution methods, and applications. Central European Journal of Operations Research, 2002, vol. 10, no. 2, pp. 113-148.

258. Sabzehparvar M., Seyed-Hosseini S. M. A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. Journal of Supercomputing, 2008, vol. 44, no. 3, pp. 257-273.

259. Franck B., Neumann K. Resource-constrained project scheduling with time windows: Structural questions and priority rule methods. Technical Report WIOR-492, Universität Karlsruhe, Germany, 1997.

260. Ballestin F., Valls V., Quintanilla S. Due dates and RCPSP. Chapter from book [[158]], pp. 79-104.

261. Brânzei R., Ferrari G., Fragnelli V., Tijs S. Two approaches to the problem of sharing delay costs in joint projects. Annals of Operations Research, 2002, vol. 109, no. 1-4, pp. 359-374.

262. Chiu H. N., Tsai D. M. An efficient search procedure for the resource-constrained multi-project scheduling problem with discounted cash flows. Construction Management and Economics, 2002, vol. 20, no. 1, pp. 55-66.

263. Özdamar L., Ulusoy G., Bayyigit M. A heuristic treatment of tardiness and net present value criteria in resource constrained project scheduling. International Journal of Physical Distribution and Logistics Management, 1998, vol. 28, no. 9/10, pp. 805-824.

264. Baptiste P., Pape C. L., Nuijten W. Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 1999, vol. 92, pp. 305-333.

265. Yang H. H., Chen Y. L. Finding the critical path in an activity network with time-switch constraints. European Journal of Operational Research, 2000, vol. 120, no. 3, pp. 603-613.

266. Vanhoucke M., Demeulemeester E. L., Herroelen W. S. Discrete time/cost trade-offs in project scheduling with time-switch constraints. Journal of the Operational Research Society, 2002, vol. 53, no. 7, pp. 741-751.

267. Krüger D., Scholl A. Managing and modelling general resource transfers in (multi-)project scheduling. OR Spektrum, 2010, vol. 32, no. 2, pp. 369-394.

268. Elmaghraby S. E. An algebra for the analysis of generalized activity networks. Management Science, 1964, vol. 10, no. 3, pp. 494-514.

269. Belhe U., Kusiak A. Resource-constrained scheduling of hierarchically structured design activity networks. IEEE Transactions on Engineering Management, 1995, vol. 42, no. 2, pp. 150-158.

270. Neumann K. Stochastic project networks: Temporal analysis, scheduling and cost minimization. Series: Lecture Notes in Economics and Mathematical Systems, vol. 344, Springer, Berlin, Germany, 1990, 237 p.

271. Kuster J., Jannach D. Handling airport ground processes based on resource-constrained project scheduling. Lecture Notes in Computer Science, 2006, vol. 4031, pp. 166-176.

272. Viana A., P. de Sousa J. Using metaheuristics in multiobjective resource constrained project scheduling. European Journal of Operational Research, 2000, vol. 120, no. 2, pp. 359-374.

273. Vanhoucke M., Demeulemeester E. L., Herroelen W. S. An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research, 2001, vol. 102, no. 1-4, pp. 179-196.

274. Franck B., Schwindt C. Different resource-constrained project scheduling models with minimal and maximal time-lags. Technical Report WIOR-450, Universität Karlsruhe, Germany, 1995.

275. Lorenzoni L. L., Ahonen H., G. de Alvarenga A. A multi-mode resource-constrained scheduling problem in the context of port operations. Computers and Industrial Engineering, 2006, vol. 50, no. 1-2, pp. 55-65.

276. Vanhoucke M. Scheduling an R&D project with quality-dependent time slots. Lecture Notes in Computer Science, 2006, vol. 3982, pp. 621-630.

277. Rom W. O., Tukel O. I., Muscatello J. R. MRP in a job shop environment using a resource constrained project scheduling model. Omega, 2002, vol. 30, no. 4, pp. 275-286.

278. Nazareth T., Verma S., Bhattacharya S., Bagchi A. The multiple resource constrained project scheduling problem: A breadth-first approach. European Journal of Operational Research, 1999, vol. 112, no. 2, pp. 347-366.

279. Al-Fawzan M., Haouari M. A bi-objective model for robust resource-constrained project scheduling. International Journal of Production Economics, 2005, vol. 96, no. 2, pp. 175-187.

280. Abbasi B., Shadrokh S., Arkat J. Bi-objective resource-constrained project scheduling with robustness and makespan criteria. Applied Mathematics and Computation, 2006, vol. 180, no. 1, pp. 146-152.

281. Kobylanski P., Kuchta D. A note on the paper by M. A. Al-Fawzan and M. Haouari about a bi-objective problem for robust resource-constrained project scheduling. International Journal of Production Economics, 2007, vol. 107, no. 2, pp. 496-501.

282. Chtourou H., Haouari M. A two-stage-priority-rule-based algorithm for robust resource-constrained project scheduling. Computers and Industrial Engineering, 2008, vol. 55, no. 1, pp. 183-194.

283. Icmeli-Tukel O., Rom W. O. Ensuring quality in resource constrained project scheduling. European Journal of Operational Research, 1997, vol. 103, no. 3, pp. 483-496.

284. Van de Vonder S., Demeulemeester E. L., Herroelen W. S. A classification of predictive-reactive project scheduling procedures. Journal of Scheduling, 2007, vol. 10, no. 3, pp. 195-207.

285. Sakkout H., Wallace M. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 2000, vol. 5, no. 4, pp. 359-388.

286. Zhu G., Bard J. F., Yu G. Disruption management for resource-constrained project scheduling. Journal of the Operational Research Society, 2005, vol. 56, pp. 365-381.

287. Neumann K., Schwindt C., Zimmermann J. Resource-constrained project scheduling with time windows: Recent developments and new applications. Chapter from book [[158]], pp. 375-407.

288. Drexl A., Kimms A. Optimization guided lower and upper bounds for the resource investment problem. Journal of the Operational Research Society, 2001, vol. 52, no. 3, pp. 340-351.

289. Ranjbar M., Kianfar F., Shadrokh S. Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Applied Mathematics and Computation, 2008, vol. 196, no. 2, pp. 879-888.

290. Yamashita D. S., Armentano V. A., Laguna M. Robust optimization models for project scheduling with resource availability cost. Journal of Scheduling, 2007, vol. 10, no. 1, pp. 67-76.

291. Shadrokh S., Kianfar F. A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. European Journal of Operational Research, 2007, vol. 181, no. 1, pp. 86-101.

292. Nübel H. The resource renting problem subject to temporal constraints. OR-Spektrum, 2001, vol. 23, no. 3, pp. 359-381.

293. Ballestin F. A genetic algorithm for the resource renting problem with minimum and maximum time lags. Lecture Notes in Computer Science, 2007, vol. 4446, pp. 25-35.

294. Bandelloni M., Tucci M., Rinaldi R. Optimal resource leveling using non-serial dynamic programming. European Journal of Operational Research, 1994, vol. 78, no. 2, pp. 162-177.

295. Davis K. R., Stam A., Grzybowski R. A. Resource constrained project scheduling with multiple objectives: A decision support approach. Computers and Operations Research, 1992, vol. 19, no. 7, pp. 657-669.

296. Maniezzo V., Mingozzi A. The project scheduling problem with irregular starting time costs. Operations Research Letters, 1999, vol. 25, no. 4, pp. 175-182.

297. Möhring R. H., Schulz A. S., Stork F., Uetz M. On project scheduling with irregular starting time costs. Operations Research Letters, 2001, vol. 28, no. 4, pp. 149-154.

298. Möhring R. H., Schulz A. S., Stork F., Uetz M. Solving project scheduling problems by minimum cut computations. Management Science, 2003, vol. 49, no. 3, pp. 330-350.

299. Achuthan N., Hardjawidjaja A. Project scheduling under time dependent costs - A branch and bound algorithm. Annals of Operations Research, 2001, vol. 108, no. 1-4, pp. 55-74.

300. Dodin B., Elimam A. A. Integrated project scheduling and material planning with variable activity duration and rewards. IIE Transactions, 2001, vol. 33, no. 11, pp. 1005-1018.

301. Nonobe K., Ibaraki T. A metaheuristic approach to the resource constrained project scheduling with variable activity durations and convex cost functions. Chapter from book [[158]], pp. 225-248.

302. Rummel J. L., Walter Z., Dewan R., Seidmann A. Activity consolidation to improve responsiveness. European Journal of Operational Research, 2005, vol. 161, no. 3, pp. 683-703.

303. Kimms A. Maximizing the net present value of a project under resource constraints using a lagrangian relaxation based heuristic with tight upper bounds. Annals of Operations Research, 2001, vol. 102, no. 1-4, pp. 221-236.

304. Mika M., Waligora G., Weglarz J. Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, 2005, vol. 164, no. 3, pp. 639-668.

305. Padman R., Zhu D. Knowledge integration using problem spaces: A study in resource-constrained project scheduling. Journal of Scheduling, 2006, vol. 9, no. 2, pp. 133-152.

306. Vanhoucke M., Demeulemeester E. L., Herroelen W. S. On maximizing the net present value of a project under renewable resource constraints. Management Science, 2001, vol. 47, no. 8, pp. 1113-1121.

307. Varma V. A., Uzsoy R., Pekny J., Blau G. Lagrangian heuristics for scheduling new product development projects in the pharmaceutical industry. Journal of Heuristics, 2007, vol. 13, no. 5, pp. 403-433.

308. Najafi A. A., Niaki S. T. A. A genetic algorithm for resource investment problem with discounted cash flows. Applied Mathematics and Computation, 2006, vol. 183, no. 2, pp. 1057-1070.

309. Herroelen W. S., P. van Dommelen, Demeulemeester E. L. Project network models with discounted cash flows: A guided tour through recent developments. European Journal of Operational Research, 1997, vol. 100, no. 1, pp. 97-121.

310. Dayanand N., Padman R. On modelling payments in projects. Journal of the Operational Research Society, 1997, vol. 48, no. 9, pp. 906-918.

311. Etgar R., Shtub A., LeBlanc L. J. Scheduling projects to maximize net present value - the case of time-dependent, contingent cash flows. European Journal of Operational Research, 1997, vol. 96, no. 1, pp. 90-96.

312. Hapke M., Jaszkiewicz A., Slowinski R. Interactive analysis of multiple-criteria project scheduling problems. European Journal of Operational Research, 1998, vol. 107, no. 2, pp. 315-324.

313. Slowinski R., Soniewicki B., Weglarz J. DSS for multiobjective project scheduling. European Journal of Operational Research, 1994, vol. 79, no. 2, pp. 220-229.

314. Dörner K. F., Gutjahr W. J., Hartl R. F., Strauss C., Stummer C. Nature-inspired metaheuristics for multiobjective activity crashing. Omega, 2008, vol. 36, no. 6, pp. 1019-1037.

315. Nabrzynski J., Weglarz J. Knowledge-based multiobjective project scheduling problems. Chapter from book [[159]], pp. 383-411.

316. Muth J. F., Thompson G. L. (eds.) Industrial Scheduling. Prentice-Hall, Englewood Cliffs, New Jersey, USA, 1963, 467 p.

317. Jozefowska J., Weglarz J. (eds.) Perspectives in Modern Project Scheduling. Springer Science & Business Media, New York, USA, 2006, 466 p.

318. Weglarz J. (eds.) Project Scheduling: Recent Models, Algorithms and Applications. Springer, New York, USA, 1999, 535 p.


Для цитирования:


Аничкин А.С., Семенов В.А. Современные модели и методы теории расписаний. Труды Института системного программирования РАН. 2014;26(3):5-50. https://doi.org/10.15514/ISPRAS-2014-26(3)-1

For citation:


Anichkin A.S., Semenov V.A. A survey of emerging models and methods of scheduling. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2014;26(3):5-50. (In Russ.) https://doi.org/10.15514/ISPRAS-2014-26(3)-1

Просмотров: 19


Creative Commons License
Контент доступен под лицензией Creative Commons Attribution 4.0 License.


ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)