![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Sigrid Knust
Person information
- affiliation: University of Osnabrück, Germany
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j59]Tabea Brandt
, Christina Büsing, Sigrid Knust:
Structural insights about avoiding transfers in the patient-to-room assignment problem. Discret. Appl. Math. 347: 231-248 (2024) - [j58]Sigrid Knust, Afzal S. Siddiqui, Christian Schlereth, Guido Voigt:
Outstanding Reviewer Award OR Spectrum 2023. OR Spectr. 46(2): 637 (2024) - 2023
- [j57]Jan-Niklas Buckow, Sigrid Knust:
The warehouse reshuffling problem with swap moves and time limit. EURO J. Transp. Logist. 12: 100113 (2023) - [j56]Sven Boge, Sigrid Knust:
The blocks relocation problem with item families minimizing the number of reshuffles. OR Spectr. 45(2): 395-435 (2023) - 2022
- [c2]Tabea Brandt
, Christina Büsing
, Sigrid Knust:
One Transfer per Patient Suffices: Structural Insights About Patient-to-Room Assignment. ISCO 2022: 245-259 - 2021
- [j55]Tobias Oelschlägel, Sigrid Knust:
Solution approaches for storage loading problems with stacking constraints. Comput. Oper. Res. 127: 105142 (2021) - 2020
- [j54]Jan-Niklas Buckow, Benjamin Graf
, Sigrid Knust:
The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands. Comput. Oper. Res. 120: 104949 (2020) - [j53]Sven Boge, Sigrid Knust:
The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage. Eur. J. Oper. Res. 280(3): 940-952 (2020) - [j52]Sven Boge, Marc Goerigk, Sigrid Knust:
Robust optimization for premarshalling with uncertain priority classes. Eur. J. Oper. Res. 287(1): 191-210 (2020)
2010 – 2019
- 2019
- [j51]David Meignan
, Sigrid Knust:
A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization. Eur. J. Oper. Res. 279(2): 320-334 (2019) - [j50]Sigrid Knust, Natalia V. Shakhlevich
, Stefan Waldherr, Christian Weiß
:
Shop scheduling problems with pliable jobs. J. Sched. 22(6): 635-661 (2019) - 2018
- [j49]Christina Büsing, Sigrid Knust, Xuan Thanh Le:
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. EURO J. Comput. Optim. 6(4): 339-365 (2018) - [j48]Matthias Bultmann, Sigrid Knust, Stefan Waldherr:
Synchronous flow shop scheduling with pliable jobs. Eur. J. Oper. Res. 270(3): 943-956 (2018) - [j47]Nils Boysen
, Dirk Briskorn
, Sigrid Knust:
Rail terminal operations. OR Spectr. 40(2): 317-318 (2018) - [j46]Matthias Bultmann, Sigrid Knust, Stefan Waldherr
:
Flow shop scheduling with flexible processing times. OR Spectr. 40(3): 809-829 (2018) - 2017
- [j45]Xuan Thanh Le, Sigrid Knust:
MIP-based approaches for robust storage loading problems with stacking constraints. Comput. Oper. Res. 78: 138-153 (2017) - [j44]Stefan Waldherr, Sigrid Knust:
Decomposition algorithms for synchronous flow shop problems with additional resources and setup times. Eur. J. Oper. Res. 259(3): 847-863 (2017) - [j43]Christian Weiß
, Stefan Waldherr, Sigrid Knust, Natalia V. Shakhlevich:
Open Shop Scheduling with Synchronization. J. Sched. 20(6): 557-581 (2017) - 2016
- [j42]Matthias Kampmeyer, Sigrid Knust, Stefan Waldherr:
Solution algorithms for synchronous flow shop problems with two dominating machines. Comput. Oper. Res. 74: 42-52 (2016) - [j41]Christian Weiß
, Sigrid Knust, Natalia V. Shakhlevich, Stefan Waldherr:
The assignment problem with nearly Monge arrays and incompatible partner indices. Discret. Appl. Math. 211: 183-203 (2016) - [j40]Jens Poppenborg, Sigrid Knust:
Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers. EURO J. Comput. Optim. 4(3-4): 349-380 (2016) - [j39]Florian Bruns, Sigrid Knust, Natalia V. Shakhlevich
:
Complexity results for storage loading problems with stacking constraints. Eur. J. Oper. Res. 249(3): 1074-1081 (2016) - [j38]Marc Goerigk
, Sigrid Knust, Xuan Thanh Le:
Robust storage loading problems with stacking and payload constraints. Eur. J. Oper. Res. 253(1): 51-67 (2016) - [j37]Jens Poppenborg, Sigrid Knust:
A flow-based tabu search algorithm for the RCPSP with transfer times. OR Spectr. 38(2): 305-334 (2016) - 2015
- [j36]Stefan Waldherr, Jens Poppenborg, Sigrid Knust:
The bottleneck transportation problem with auxiliary resources. 4OR 13(3): 279-292 (2015) - [j35]Stefan Waldherr, Sigrid Knust:
Complexity results for flow shop problems with synchronous movement. Eur. J. Oper. Res. 242(1): 34-44 (2015) - [j34]Stefan Waldherr, Sigrid Knust, Stefan Aust:
Message scheduling for real-time interprocessor communication. J. Syst. Archit. 61(8): 374-382 (2015) - [j33]Mareike Paul, Sigrid Knust:
A classification scheme for integrated staff rostering and scheduling problems. RAIRO Oper. Res. 49(2): 393-412 (2015) - [j32]David Meignan
, Sigrid Knust, Jean-Marc Frayret, Gilles Pesant, Nicolas Gaud
:
A Review and Taxonomy of Interactive Optimization Methods in Operations Research. ACM Trans. Interact. Intell. Syst. 5(3): 17:1-17:43 (2015) - 2014
- [j31]Christian Viergutz, Sigrid Knust:
Integrated production and distribution scheduling with lifespan constraints. Ann. Oper. Res. 213(1): 293-318 (2014) - [j30]Jana Lehnfeld, Sigrid Knust:
Loading, unloading and premarshalling of stacks in storage areas: Survey and classification. Eur. J. Oper. Res. 239(2): 297-312 (2014) - [j29]Florian Bruns, Marc Goerigk
, Sigrid Knust, Anita Schöbel:
Robust load planning of trains in intermodal transportation. OR Spectr. 36(3): 631-668 (2014) - [j28]Wolfgang W. Bein, Johann L. Hurink, Sigrid Knust:
In Memoriam Peter Brucker. J. Sched. 17(1): 3 (2014) - 2013
- [j27]Alessandro Condotta, Sigrid Knust, Dimitri Meier, Natalia V. Shakhlevich
:
Tabu search and lower bounds for a combined production-transportation problem. Comput. Oper. Res. 40(3): 886-900 (2013) - [j26]Christian Artigues, Peter Brucker, Sigrid Knust, Oumar Koné, Pierre Lopez, Marcel Mongeau:
A note on "event-based MILP models for resource-constrained project scheduling problems". Comput. Oper. Res. 40(4): 1060-1063 (2013) - 2012
- [j25]Florian Bruns, Sigrid Knust:
Optimized load planning of trains in intermodal transportation. OR Spectr. 34(3): 511-533 (2012) - 2011
- [p3]Sigrid Knust:
Scheduling of Tournaments or Sports Leagues. Algorithms Unplugged 2011: 267-275 - 2010
- [j24]Graham Kendall
, Sigrid Knust, Celso C. Ribeiro
, Sebastián Urrutia
:
Scheduling in sports: An annotated bibliography. Comput. Oper. Res. 37(1): 1-19 (2010) - [j23]Dirk Briskorn
, Sigrid Knust:
Constructing fair sports league schedules with regard to strength groups. Discret. Appl. Math. 158(2): 123-135 (2010) - [j22]Sigrid Knust:
Scheduling non-professional table-tennis leagues. Eur. J. Oper. Res. 200(2): 358-367 (2010) - [j21]Alessandro Condotta, Sigrid Knust, Natalia V. Shakhlevich
:
Parallel batch scheduling of equal-length jobs with release and due dates. J. Sched. 13(5): 463-477 (2010)
2000 – 2009
- 2009
- [j20]Sigrid Knust, Daniel Lücking:
Minimizing costs in round robin tournaments with place constraints. Comput. Oper. Res. 36(11): 2937-2943 (2009) - [p2]Peter Brucker, Sigrid Knust:
On the Complexity of Scheduling. Introduction to Scheduling 2009: 1-21 - 2008
- [j19]Sigrid Knust:
Scheduling sports tournaments on a single court minimizing waiting times. Oper. Res. Lett. 36(4): 471-476 (2008) - [p1]Sigrid Knust:
Turnier- und Sportligaplanung. Taschenbuch der Algorithmen 2008: 275-284 - 2006
- [j18]Sigrid Knust, Michael von Thaden:
Balanced home-away assignments. Discret. Optim. 3(4): 354-365 (2006) - [j17]Peter Brucker, Sigrid Knust, Ceyda Oguz
:
Scheduling chains with identical jobs and constant delays on a single machine. Math. Methods Oper. Res. 63(1): 63-75 (2006) - 2005
- [j16]Johann L. Hurink
, Sigrid Knust:
Tabu search algorithms for job-shop problems with a single transport robot. Eur. J. Oper. Res. 162(1): 99-111 (2005) - [j15]Peter Brucker, Sigrid Knust, Guoqing Wang:
Complexity results for flow-shop problems with a single server. Eur. J. Oper. Res. 165(2): 398-407 (2005) - 2004
- [j14]Philippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky:
Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004) - [j13]Peter Brucker, Sigrid Knust, T. C. Edwin Cheng
, Natalia V. Shakhlevich:
Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Ann. Oper. Res. 129(1-4): 81-106 (2004) - 2003
- [j12]Peter Brucker, Sigrid Knust:
Sequencing and scheduling. Eur. J. Oper. Res. 149(2): 247-248 (2003) - [j11]Peter Brucker, Sigrid Knust:
Lower bounds for resource-constrained project scheduling problems. Eur. J. Oper. Res. 149(2): 302-313 (2003) - [j10]Peter Brucker, Johann L. Hurink
, Sigrid Knust:
A polynomial algorithm for P | pj=1, rj, outtree | ∑ Cj. Math. Methods Oper. Res. 56(3): 407-412 (2003) - 2002
- [j9]Peter Brucker, Sigrid Knust:
Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Ann. Oper. Res. 115(1-4): 147-172 (2002) - [j8]Johann L. Hurink
, Sigrid Knust:
A tabu search algorithm for scheduling a single robot in a job-shop environment. Discret. Appl. Math. 119(1-2): 181-203 (2002) - [j7]Peter Brucker, Silvia Heitmann, Sigrid Knust:
Scheduling railway traffic at a construction site. OR Spectr. 24(1): 19-30 (2002) - 2001
- [j6]Johann L. Hurink
, Sigrid Knust:
Makespan minimization for flow-shop problems with transportation times and a single robot. Discret. Appl. Math. 112(1-3): 199-216 (2001) - [j5]Johann L. Hurink
, Sigrid Knust:
List scheduling in a parallel machine environment with precedence constraints and setup times. Oper. Res. Lett. 29(5): 231-239 (2001) - 2000
- [j4]Peter Brucker, Sigrid Knust:
A linear programming and constraint propagation-based lower bound for the RCPSP. Eur. J. Oper. Res. 127(2): 355-362 (2000) - [j3]Peter Brucker, Sigrid Knust, Duncan Roper, Yakov Zinder
:
Scheduling UET task systems with concurrency on two parallel identical processors. Math. Methods Oper. Res. 52(3): 369-387 (2000) - [c1]Peter Brucker, Sigrid Knust:
Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293
1990 – 1999
- 1999
- [j2]Peter Brucker, Sigrid Knust:
Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999) - 1998
- [j1]Peter Brucker, Sigrid Knust, Arno Schoo, Olaf Thiele:
A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107(2): 272-288 (1998)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-13 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint