Reinhard Bürgy

Orcid: 0000-0002-0349-4275

According to our database1, Reinhard Bürgy authored at least 10 papers between 2011 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Facility Location Problem with Minimum Workload and Penalties for Waste Collection.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

2020
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem.
Comput. Oper. Res., 2020

2019
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers.
EURO J. Comput. Optim., 2019

2018
The job shop scheduling problem with convex costs.
Eur. J. Oper. Res., 2018

2017
A neighborhood for complex job shop scheduling problems with regular objectives.
J. Sched., 2017

The no-wait job shop with regular objective: a method based on optimal job insertion.
J. Comb. Optim., 2017

Online heuristics for unloading boxes off a gravity conveyor.
Int. J. Prod. Res., 2017

2016
The blocking job shop with rail-bound transportation.
J. Comb. Optim., 2016

2013
Optimal job insertion in the no-wait job shop.
J. Comb. Optim., 2013

2011
The flexible blocking job shop with transfer and set-up times.
J. Comb. Optim., 2011


  Loading...