Fachbereich 6 Mathematik/Informatik

Institut für Informatik


Navigation und Suche der Universität Osnabrück


Hauptinhalt

Topinformationen

Publications

Journals
 

  • S. Waldherr, S. Knust, D. Briskorn (2017): Synchronous flow shop problems: How much can we gain by leaving machines idle?
    Omega 72, 15-24.  DOI:10.1016/j.omega.2016.10.006
  • S. Waldherr, S. Knust (2017): Decomposition algorithms for synchronous flow shop problems with additional resources and setup times
    European Journal of Operational Research 259, 847–863.  DOI:10.1016/j.ejor.2016.11.015
  • X.T. Le, S. Knust (2017): MIP-based approaches for robust storage loading problems with stacking constraints
    Computers and Operations Research 78, 138-153. DOI:10.1016/j.cor.2016.08.016
  • C. Weiß, S. Waldherr, S. Knust, N.V. Shakhlevich (2016): Open shop scheduling with synchronization
    Journal of Scheduling,   DOI:10.1007/s10951-016-0490-0
  • C. Weiß, S. Knust, N.V. Shakhlevich, S. Waldherr (2016): The assignment problem with nearly Monge arrays and incompatible partner indices
    Discrete Applied Mathematics 211, 183-203.  DOI:10.1016/j.dam.2016.04.019
  • J. Poppenborg, S. Knust (2016): Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers
    EURO Journal on Computational Optimization 4, 349-380. DOI:10.1007/s13675-015-0061-8
  • M. Kampmeyer, S. Knust, S. Waldherr (2016): Solution algorithms for synchronous flow shop problems with two dominating machines
    Computers and Operations Research 74, 42-52.  DOI:10.1016/j.cor.2016.04.010
  • M. Goerigk, S. Knust, X.T. Le (2016): Robust storage loading problems with stacking and payload constraints
    European Journal of Operational Research 253, 51-67. DOI:10.1016/j.ejor.2016.02.019
  • J. Poppenborg, S. Knust (2016): A flow-based tabu search algorithm for the RCPSP with transfer times
    OR Spectrum 38, 305-334  DOI:10.1007/s00291-015-0402-2
  • F. Bruns, S. Knust, N.V. Shakhlevich (2016): Complexity results for storage loading problems with stacking constraints
    European Journal of Operational Research 249, 1074-1081.  DOI:10.1016/j.ejor.2015.09.036
  • D. Meignan, S. Knust, J.-M. Frayret, G. Pesant, N. Gaud (2015): A review and taxonomy of interactive optimization methods in operations research
    ACM Transactions on Interactive Intelligent Systems 5.  DOI:10.1145/2808234
  • S. Waldherr, S. Knust, S. Aust (2015): Message scheduling for real-time interprocessor communication
    Journal of Systems Architecture 61, 374-382.  DOI:10.1016/j.sysarc.2015.06.002
  • S. Waldherr, J. Poppenborg, S. Knust (2015): The bottleneck transportation problem with auxiliary resources
    4OR - A Quarterly Journal of Operations Research 13, 279-292.  DOI:10.1007/s10288-015-0284-9
  • S. Waldherr, S. Knust (2015): Complexity results for flow shop problems with synchronous movement
    European Journal of Operational Research 242, 34-44.  DOI:10.1016/j.ejor.2014.09.053
  • M. Paul, S. Knust (2015): A classification scheme for integrated staff rostering and scheduling problems
    RAIRO Operations Research 49, 393-412.  DOI:10.1051/ro/2014052
  • J. Lehnfeld, S. Knust (2014): Loading, unloading and premarshalling of stacks in storage areas: Survey and classification
    European Journal of Operational Research 239, 297–312.   DOI:10.1016/j.ejor.2014.03.011 
  • F. Bruns, M. Goerigk, S. Knust, A. Schöbel (2014): Robust load planning of trains in intermodal transportation
    OR Spectrum 36, 631-668.   DOI:10.1007/s00291-013-0341-8 
  • S. Waldherr, S. Knust (2014): Two-stage scheduling in shelf-board production: A case study
    International Journal of Production Research 52, 4078-4092.   DOI:10.1080/00207543.2013.809495 
  • C. Viergutz, S. Knust (2014): Integrated production and distribution scheduling with lifespan constraints
    Annals of Operations Research 213, 293-318.   DOI:10.1007/s10479-012-1197-z   Data 
  • C. Artigues, P. Brucker, S. Knust, O. Kone, P. Lopez, M. Mongeau (2013): A note on ``Event-based MILP models for resource-constrained project scheduling problems''
    Computers and Operations Research 40, 1060-1063. DOI:10.1016/j.cor.2012.10.018 
  • A. Condotta, S. Knust, D. Meier, N.V. Shakhlevich (2013): Tabu search and lower bounds for a combined production-transportation problem
    Computers and Operations Research 40, 886-900. DOI:10.1016/j.cor.2012.08.017 
  • J. Poppenborg, S. Knust, J. Hertzberg (2012): Online scheduling of flexible job-shops with blocking and transportation
    European Journal of Industrial Engineering 6, 497-518.   DOI:10.1504/EJIE.2012.047662   Data 
  • F. Bruns, S. Knust (2012): Optimized load planning of trains in intermodal transportation
    OR Spectrum 34, 511-533.   DOI:10.1007/s00291-010-0232-1 
  • A. Condotta, S. Knust, N.V. Shakhlevich (2010): Parallel batch scheduling of equal-length jobs with release and due dates
    Journal of Scheduling 13, 463-477.   DOI:10.1007/s10951-010-0176-y 
  • S. Knust (2010): Scheduling non-professional table-tennis leagues
    European Journal of Operational Research 200, 358-367.   DOI:10.1016/j.ejor.2009.01.015 
  • G. Kendall, S. Knust, C.C. Ribeiro, S. Urrutia (2010): Scheduling in sports: An annotated bibliography
    Computers and Operations Research 37, 1-19.   DOI:10.1016/j.cor.2009.05.013 
  • D. Briskorn, S. Knust (2010): Constructing fair sports league schedules with regard to strength groups
    Discrete Applied Mathematics 158, 123-135.   DOI:10.1016/j.dam.2009.08.006 
  • S. Knust, D. Lücking (2009): Minimizing costs in round robin tournaments with place constraints
    Computers and Operations Research 36, 2937-2943.   DOI:10.1016/j.cor.2009.01.004 
  • P. Brucker, S. Knust, C. Oguz (2006): Scheduling chains with identical jobs and constant delays on a single machine
    Mathematical Methods of Operations Research 63, 63-75.   DOI:10.1007/s00186-005-0014-8 
  • P. Brucker, S. Knust, G. Wang (2005): Complexity results for flow-shop problems with a single server
    European Journal of Operational Research 165, 398-407.   DOI:10.1016/j.ejor.2004.04.010 
  • J. Hurink, S. Knust (2005): Tabu search algorithms for job-shop problems with a single transport robot
    European Journal of Operational Research 162, 99-111.   DOI:10.1016/j.ejor.2003.10.034   Data 
  • P. Brucker, T.C.E. Cheng, S. Knust, N.V. Shakhlevich (2004): Complexity results for flow-shop and open-shop scheduling problems with transportation delays
    Annals of Operations Research 129, 81-106.   DOI:10.1023/B:ANOR.0000030683.64615.c8 
  • P. Baptiste, P. Brucker, S. Knust, V.G. Timkovskyu (2004): Ten notes on equal-processing-time scheduling
    Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR) 2, 111-127.   DOI:10.1007/s10288-003-0024-4 
  • P. Brucker, S. Knust (2003): Lower bounds for resource-constrained project scheduling problems
    European Journal of Operational Research 149, 302-313.   DOI:10.1016/S0377-2217(02)00762-2   Results 
  • P. Brucker, J. Hurink, S. Knust (2002): A polynomial algorithm for P | pj=1, rj, outtree | sum Cj
    Mathematical Methods of Operations Research 56, 407-412.   DOI:10.1007/s001860200228 
  • P. Brucker, S. Knust (2002): Lower bounds for scheduling a single robot in a job-shop environment
    Annals of Operations Research 115, 147-172.   DOI:10.1023/A:1021149204501   Data 
  • P. Brucker, S. Heitmann, S. Knust (2002): Scheduling railway traffic at a construction site
    OR Spectrum 24, 19-30.   DOI:10.1007/s291-002-8198-0 
  • P. Brucker, C. Dhaenens-Flipo, S. Knust, S.A. Kravchenko, F. Werner (2002): Complexity results for parallel machine problems with a single server
    Journal of Scheduling 5, 429-457.   DOI:10.1002/jos.120 
  • J. Hurink, S. Knust (2002): A tabu search algorithm for scheduling a single robot in a job-shop environment
    Discrete Applied Mathematics 119, 181-203.   DOI:10.1016/S0166-218X(01)00273-6   Data 
  • J. Hurink, S. Knust (2001): Makespan minimization for flow-shop problems with transportation times and a single robot
    Discrete Applied Mathematics 112, 199-216.   DOI:10.1016/S0166-218X(00)00316-4 
  • J. Hurink, S. Knust (2001): List scheduling in a parallel machine environment with precedence constraints and setup times
    OR Letters 29, 231-239.   DOI:10.1016/S0167-6377(01)00104-3 
  • P. Brucker, S. Knust (2000): A linear programming and constraint propagation-based lower bound for the RCPSP
    European Journal of Operational Research 127, 355-362.   DOI:10.1016/S0377-2217(99)00489-0 
  • P. Brucker, S. Knust, D. Roper, Y. Zinder (2000): Scheduling UET task systems with concurrency on two parallel identical processors
    Mathematical Methods of Operations Research 52, 369-387.   DOI:10.1007/s001860000089 
  • P. Brucker, S. Knust (1999): Complexity results for single-machine problems with positive finish-start time-lags
    Computing 63, 299-316.   DOI:10.1007/s006070050036 
  • P. Brucker, S. Knust, A. Schoo, O. Thiele (1998): A branch and bound algorithm for the resource-constrained project scheduling problem
    European Journal of Operational Research 107, 272-288.   DOI:10.1016/S0377-2217(97)00335-4

 

 

 

Books and book chapters

  • P. Brucker, S. Knust (2006): Complex Scheduling, Springer, ISBN 978-3-540-29545-7. Web site
  • S. Knust (2015): Lower bounds on the minimum project duration
    in: C. Schwindt, J. Zimmermann (eds.): Handbook on Project Management and Scheduling, Vol.1, International Handbooks on Information Systems, Springer, 43-55.   DOI 10.1007/978-3-319-05443-8_3
  • S. Knust (2011): Scheduling of tournaments or sports leagues
    in: B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner (eds.): Algorithms Unplugged, Springer, 267-275.   DOI:10.1007/978-3-642-15328-0_27
  • S. Knust (2011): "Diskret" optimierte Pläne im Alltag
    in: K. Wendland, A. Werner (eds.): Facettenreiche Mathematik - Einblicke in die moderne mathematische Forschung, Vieweg+Teubner, 257-272. 
  • P. Brucker, S. Knust (2009): On the complexity of scheduling
    in: Y. Robert, F. Vivien (eds.): Introduction to Scheduling, Chapman and Hall/CRC Press. CRC Press, 1-21. 
  • S. Knust (2008): Turnier- und Sportligaplanung
    in: B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner (eds.): Taschenbuch der Algorithmen, Springer, 275-284. 
  • P. Brucker, S. Knust (2000): Scheduling
    in Theme 6.5. Optimization and Operations Research, edited by U. Derigs, in Encyclopedia of Life Support Systems (EOLSS) developed under the auspices of the UNESCO, Eolss Publishers, Oxford, UK. 
  • P. Brucker, S. Heitmann, S. Knust (2004): Scheduling railway traffic at a construction site
    in: H.-O. Günther, K.H. Kim (eds.): Container Terminals and Automated Transport Systems Logistics Control Issues and Quantitative Decision Support, Springer
  • P. Brucker, S. Knust (2001): Resource-constrained project scheduling and timetabling
    in: E.Burke, W.Erben (ed.): The Practice and Theory of Automated Timetabling III, Springer Lecture Notes in Computer Science Vol. 2079, 277-293. 
  • T. Baar, P. Brucker, S. Knust (1998): Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem
    in: S.Voss, S.Martello, I.Osman, C.Roucairol (eds.): Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, 1-18.   Results 
  • P. Brucker, S. Knust (1998): Solving large-sized resource-constrained project scheduling problems
    in: J.Weglarz (ed.): Project Scheduling: Recent Models, Algorithms and Applications, Kluwer, 27-51. 

 

Miscellaneous