Auflistung: nach Autor Knust, Sigrid


Oder wählen Sie unten einen Buchstaben aus, um nach Nachnamen zu suchen
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
15 bis 34 von 80 Treffer < zurück   nächste >
ErscheinungsdatumTitelAutor(en)
2012Complex Job-Shop SchedulingBrucker, Peter; Knust, Sigrid 
2012Complex scheduling, second editionBrucker, P.; Knust, S. 
2015Complexity results for flow shop problems with synchronous movementWaldherr, Stefan ; Knust, Sigrid 
2004Complexity results for flow-shop and open-shop scheduling problems with transportation delaysBrucker, P; Knust, S ; Cheng, TCE; Shakhlevich, NV 
2005Complexity results for flow-shop problems with a single serverBrucker, P; Knust, S ; Wang, GQ
2002Complexity results for parallel machine problems with a single serverBrucker, P; Dhaenens-Flipo, C; Knust, S ; Kravchenko, SA; Werner, F
1999Complexity results for single-machine problems with positive finish-start time-lagsBrucker, P; Knust, S 
2016Complexity results for storage loading problems with stacking constraintsBruns, Florian; Knust, Sigrid ; Shakhlevich, Natalia V. 
2017Decomposition algorithms for synchronous flow shop problems with additional resources and setup timesWaldherr, Stefan ; Knust, Sigrid 
2011„Diskret“ optimierte Pläne im AlltagKnust, Sigrid 
2008Fairness in round robin tournamentsBriskorn, D. ; Knust, S. 
2018Flow shop scheduling with flexible processing timesBultmann, Matthias ; Knust, Sigrid ; Waldherr, Stefan 
2014In Memoriam Peter BruckerBein, Wolfgang; Hurink, Johann; Knust, Sigrid 
2014Integrated production and distribution scheduling with lifespan constraintsViergutz, Christian; Knust, Sigrid 
2001List scheduling in a parallel machine environment with precedence constraints and setup timesHurink, J; Knust, S 
2014Loading, unloading and premarshalling of stacks in storage areas: Survey and classificationLehnfeld, Jana; Knust, Sigrid 
2003Lower bounds for resource-constrained project scheduling problemsBrucker, P; Knust, S 
2002Lower bounds for scheduling a single robot in a job-shop environmentBrucker, P; Knust, S 
2015Lower bounds on the minimum project durationKnust, S. 
2001Makespan minimization for flow-shop problems with transportation times and a single robotHurink, J; Knust, S