Sigrid Knust
Affiliations:- University of Osnabrück, Germany
According to our database1,
Sigrid Knust
authored at least 64 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Structural insights about avoiding transfers in the patient-to-room assignment problem.
Discret. Appl. Math., 2024
2023
The blocks relocation problem with item families minimizing the number of reshuffles.
OR Spectr., June, 2023
EURO J. Transp. Logist., 2023
2022
One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022
2021
Comput. Oper. Res., 2021
2020
The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage.
Eur. J. Oper. Res., 2020
Eur. J. Oper. Res., 2020
The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands.
Comput. Oper. Res., 2020
2019
A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization.
Eur. J. Oper. Res., 2019
2018
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation.
EURO J. Comput. Optim., 2018
2017
Decomposition algorithms for synchronous flow shop problems with additional resources and setup times.
Eur. J. Oper. Res., 2017
Comput. Oper. Res., 2017
2016
OR Spectr., 2016
Eur. J. Oper. Res., 2016
Eur. J. Oper. Res., 2016
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers.
EURO J. Comput. Optim., 2016
Discret. Appl. Math., 2016
Comput. Oper. Res., 2016
2015
ACM Trans. Interact. Intell. Syst., 2015
RAIRO Oper. Res., 2015
J. Syst. Archit., 2015
Eur. J. Oper. Res., 2015
2014
Loading, unloading and premarshalling of stacks in storage areas: Survey and classification.
Eur. J. Oper. Res., 2014
Ann. Oper. Res., 2014
2013
Comput. Oper. Res., 2013
A note on "event-based MILP models for resource-constrained project scheduling problems".
Comput. Oper. Res., 2013
2012
2011
Proceedings of the Algorithms Unplugged, 2011
2010
J. Sched., 2010
Discret. Appl. Math., 2010
2009
Comput. Oper. Res., 2009
Proceedings of the Introduction to Scheduling., 2009
2008
Oper. Res. Lett., 2008
2006
Math. Methods Oper. Res., 2006
2005
Eur. J. Oper. Res., 2005
Eur. J. Oper. Res., 2005
2004
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays.
Ann. Oper. Res., 2004
2003
A polynomial algorithm for P | p<sub>j</sub>=1, r<sub>j</sub>, outtree | ∑ C<sub>j</sub>.
Math. Methods Oper. Res., 2003
Eur. J. Oper. Res., 2003
2002
Discret. Appl. Math., 2002
Ann. Oper. Res., 2002
2001
List scheduling in a parallel machine environment with precedence constraints and setup times.
Oper. Res. Lett., 2001
Makespan minimization for flow-shop problems with transportation times and a single robot.
Discret. Appl. Math., 2001
2000
Math. Methods Oper. Res., 2000
Eur. J. Oper. Res., 2000
Proceedings of the Practice and Theory of Automated Timetabling III, 2000
1999
Computing, 1999
1998
A branch and bound algorithm for the resource-constrained project scheduling problem.
Eur. J. Oper. Res., 1998