受强制性开放获取政策约束的文章 - Reinhard Bürgy了解详情
无法在其他位置公开访问的文章：3 篇
Employee scheduling with short demand perturbations and extensible shifts
R Bürgy, H Michon-Lacaze, G Desaulniers
Omega 89, 177-192, 2019
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers
D Attia, R Bürgy, G Desaulniers, F Soumis
EURO Journal on Computational Optimization 7 (4), 325-357, 2019
强制性开放获取政策： Natural Sciences and Engineering Research Council of Canada
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem
R Bürgy, A Hertz, P Baptiste
Computers & Operations Research 124, 105063, 2020
强制性开放获取政策： Swiss National Science Foundation
可在其他位置公开访问的文章：5 篇
The job shop scheduling problem with convex costs
R Bürgy, K Bülbül
European Journal of Operational Research 268 (1), 82-100, 2018
强制性开放获取政策： Swiss National Science Foundation
A neighborhood for complex job shop scheduling problems with regular objectives
R Bürgy
Journal of Scheduling 20 (4), 391-422, 2017
强制性开放获取政策： Swiss National Science Foundation
The no-wait job shop with regular objective: a method based on optimal job insertion
R Bürgy, H Gröflin
Journal of Combinatorial Optimization 33, 977-1010, 2017
强制性开放获取政策： Swiss National Science Foundation
Online heuristics for unloading boxes off a gravity conveyor
P Baptiste, R Bürgy, A Hertz, D Rebaine
International Journal of Production Research 55 (11), 3046-3057, 2017
强制性开放获取政策： Swiss National Science Foundation
A stochastic online algorithm for unloading boxes from a conveyor line
R Bürgy, P Baptiste, A Hertz, D Rebaine, A Linhares
Flexible Services and Manufacturing Journal 30 (4), 764–784, 2018
强制性开放获取政策： Swiss National Science Foundation
出版信息和资助信息由计算机程序自动确定