The flexible blocking job shop with transfer and set-up times. - Heinz Gröflin; Dinh-Nguyen Pham; Reinhard Bürgy (J. Comb. Optim., 2011)

Optimal job insertion in the no-wait job shop. - Reinhard Bürgy; Heinz Gröflin (J. Comb. Optim., 2013)

The blocking job shop with rail-bound transportation. - Reinhard Bürgy; Heinz Gröflin (J. Comb. Optim., 2016)

Online heuristics for unloading boxes off a gravity conveyor. - Pierre Baptiste; Reinhard Bürgy; Alain Hertz; Djamal Rebaine (Int. J. Prod. Res., 2017)

The no-wait job shop with regular objective: a method based on optimal job insertion. - Reinhard Bürgy; Heinz Gröflin (J. Comb. Optim., 2017)

A neighborhood for complex job shop scheduling problems with regular objectives. - Reinhard Bürgy (J. Sched., 2017)

The job shop scheduling problem with convex costs. - Reinhard Bürgy; Kerem Bülbül (Eur. J. Oper. Res., 2018)

A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. - Dalia Attia; Reinhard Bürgy; Guy Desaulniers; François Soumis (EURO J. Comput. Optim., 2019)

An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. - Reinhard Bürgy; Alain Hertz; Pierre Baptiste (Comput. Oper. Res., 2020)

A Facility Location Problem with Minimum Workload and Penalties for Waste Collection. - Meritxell Pacheco Paneque; Vera Fischer; Reinhard Bürgy (OR, 2021)

A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection. - Vera Fischer; Meritxell Pacheco Paneque; Antoine Legrain; Reinhard Bürgy (Eur. J. Oper. Res., 2024)