Monter d'un niveau |
Bürgy, R., Hertz, A., & Baptiste, P. (2020). An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. Computers & Operations Research, 124, 24 pages. Lien externe
Attia, D., Bürgy, R., Desaulniers, G., & Soumis, F. (2019). A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. EURO Journal on Computational Optimization, 7(4), 325-357. Lien externe
Bürgy, R., & Bulbul, K. (2018). The job shop scheduling problem with convex costs. European Journal of Operational Research, 268(1), 82-100. Lien externe
Bürgy, R., Baptiste, P., Hertz, A., Rebaine, D., & Linhares, A. (2018). A stochastic online algorithm for unloading boxes from a conveyor line. Flexible Services and Manufacturing Journal, 30(4), 764-784. Lien externe
Bürgy, R., & Bülbül, K. (2017). The job shop scheduling problem with convex costs. (Rapport technique n° G-2017-54). Lien externe
Bürgy, R. (2017). A neighborhood for complex job shop scheduling problems with regular objectives. Journal of Scheduling, 20(4), 391-422. Lien externe
Bürgy, R., & Gröflin, H. (2016). The no-wait job shop with regular objective: a method based on optimal job insertion. Journal of Combinatorial Optimization, 33(3), 977-1010. Lien externe