|
|
|
|
Список литературы
|
|
| |
| 1. |
Brucker P., Scheduling algorithms, Springer, Heidelberg, 2007   |
| 2. |
Лазарев А.А., Теория расписаний. Методы и алгоритмы, ИПУ РАН, М., 2019 |
| 3. |
Lazarev A., Khusnullin N., Musatova E., Yadrentsev D., Kharlamov M., Ponomarev K., “Minimization of the weighted total sparsity of cosmonaut training courses”, Optimization and Applications, OPTIMA 2018, Communications in Computer and Information Science, 2019, 202–215  |
| 4. |
Harhalakis G., “Special features of precedence network charts”, Eur. J. Oper. Res., Elsevier Publ., 49:1 (1990), 50–59 |
| 5. |
Csébfalvi A.B., Csébfalvi G., “Hammock activities in project scheduling”, Proceedings of the Sixteenth Annual Conference of POMS, 2005 |
| 6. |
Eliezer O., A new bi-objective hybrid metaheuristic algorithm for the resource- constrained hammock cost problem (RCHCP), Doctoral Dissertation, Pécs, 2011 |
| 7. |
El-Rayes K., Moselhi O., “Resource-driven scheduling of repetitive activities”, Construction Management and Economics, 16:4 (1998), 433–446 |
| 8. |
Vanhoucke M., Work continuity constraints in project scheduling, Working Paper 04/265, Ghent University, Faculty of Economics and Business Administration, Belgium, 2004 |
| 9. |
Vanhoucke M., Van Osselaer K., Work continuity in a real-life schedule: the Westerschelde Tunne, Working Paper 04/271, Ghent University, Faculty of Economics and Business Administration, Belgium, 2005 |
| 10. |
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, 5, Elsevier Publ., 1979, 287–326 |
| 11. |
Lenstra J.K., Rinnooy Kan A.H.G., “Complexity of scheduling under precedence constraints”, Oper. Res., 26:1 (1978), 22–35 |
| 12. |
Cormen T.H., Leiserson C.E., Rivest R.L., Stein C., Introduction to algorithms, MIT press, 2022 |
| 13. |
IBM ILOG CPLEX Optimization Studio, https://www.ibm.com/products/ilog-cplex-optimization-studio |
| 14. |
Potts C.N., “An algorithm for the single machine sequencing problem with precedence constraint”, Combinatorial Optimization II, Mathematical Programming Studies, 13, Springer, Berlin–Heidelberg, 1980, 78–87 |
