Uni-Logo AG Kombinatorische Optimierung

Publications

Journals

  1. J. Poppenborg, S. Knust, J. Hertzberg: Online scheduling of flexible job-shops with blocking and transportation
    to appear in European Journal of Industrial Engineering  

  2. F. Bruns, S. Knust: Optimized load planning of trains in intermodal transportation
    OR Spectrum (2011).   DOI:10.1007/s00291-010-0232-1

  3. S. Knust, E. Schumacher: Shift scheduling for tank trucks
    Omega 39 (2011), 513-521.   DOI:10.1016/j.omega.2010.10.009

  4. A. Condotta, S. Knust, N.V. Shakhlevich: Parallel batch scheduling of equal-length jobs with release and due dates
    Journal of Scheduling 13 (2010), 463-477.   DOI:10.1007/s10951-010-0176-y

  5. S. Knust: Scheduling non-professional table-tennis leagues
    European Journal of Operational Research 200 (2010), 358-367.   DOI:10.1016/j.ejor.2009.01.015

  6. G. Kendall, S. Knust, C.C. Ribeiro, S. Urrutia: Scheduling in sports: An annotated bibliography
    Computers and Operations Research 37 (2010), 1-19.   DOI:10.1016/j.cor.2009.05.013

  7. D. Briskorn, S. Knust: Constructing fair sports league schedules with regard to strength groups
    Discrete Applied Mathematics 158 (2010), 123-135.   DOI:10.1016/j.dam.2009.08.006

  8. S. Knust, D. Lücking: Minimizing costs in round robin tournaments with place constraints
    Computers and Operations Research 36 (2009), 2937-2943.   DOI:10.1016/j.cor.2009.01.004

  9. S. Knust: Scheduling sports tournaments on a single court minimizing waiting times
    Operations Research Letters 36 (2008), 471-476.   DOI:10.1016/j.orl.2007.11.006    Corresponding Schedules

  10. A. Drexl, S. Knust: Sports league scheduling: graph- and resource-based models
    Omega 35 (2007), 465-471.   DOI:10.1016/j.omega.2005.08.002

  11. S. Knust, M. von Thaden: Balanced home-away assignments
    Discrete Optimization 3 (2006), 354-365.   DOI:10.1016/j.disopt.2006.07.002

  12. P. Brucker, S. Knust, C. Oguz: Scheduling chains with identical jobs and constant delays on a single machine
    Mathematical Methods of Operations Research 63 (2006), 63-75.   DOI:10.1007/s00186-005-0014-8

  13. P. Brucker, S. Knust, G. Wang: Complexity results for flow-shop problems with a single server
    European Journal of Operational Research 165 (2005), 398-407.   DOI:10.1016/j.ejor.2004.04.010

  14. J. Hurink, S. Knust: Tabu search algorithms for job-shop problems with a single transport robot
    European Journal of Operational Research 162 (2005), 99-111.   DOI:10.1016/j.ejor.2003.10.034

  15. P. Brucker, T.C.E. Cheng, S. Knust, N.V. Shakhlevich: Complexity results for flow-shop and open-shop scheduling problems with transportation delays
    Annals of Operations Research 129 (2004), 81-106.   DOI:10.1023/B:ANOR.0000030683.64615.c8

  16. P. Baptiste, P. Brucker, S. Knust, V.G. Timkovsky: Ten notes on equal-processing-time scheduling
    Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR) 2 (2004), 111-127.   DOI:10.1007/s10288-003-0024-4

  17. P. Brucker, S. Knust: Lower bounds for resource-constrained project scheduling problems
    European Journal of Operational Research 149 (2003), 302-313.   DOI:10.1016/S0377-2217(02)00762-2

  18. P. Brucker, J. Hurink, S. Knust: A polynomial algorithm for P | pj=1, rj, outtree | sum Cj
    Mathematical Methods of Operations Research 56 (2002), 407-412.   DOI:10.1007/s001860200228

  19. P. Brucker, S. Knust: Lower bounds for scheduling a single robot in a job-shop environment
    Annals of Operations Research 115 (2002), 147-172.   DOI:10.1023/A:1021149204501

  20. P. Brucker, S. Heitmann, S. Knust: Scheduling railway traffic at a construction site
    OR Spectrum 24 (2002), 19-30.   DOI:10.1007/s291-002-8198-0

  21. P. Brucker, C. Dhaenens-Flipo, S. Knust, S.A. Kravchenko, F. Werner: Complexity results for parallel machine problems with a single server
    Journal of Scheduling 5 (2002), 429-457.   DOI:10.1002/jos.120

  22. J. Hurink, S. Knust: A tabu search algorithm for scheduling a single robot in a job-shop environment
    Discrete Applied Mathematics 119 (2002), 181-203.   DOI:10.1016/S0166-218X(01)00273-6

  23. J. Hurink, S. Knust: Makespan minimization for flow-shop problems with transportation times and a single robot
    Discrete Applied Mathematics 112 (2001), 199-216.   DOI:10.1016/S0166-218X(00)00316-4

  24. J. Hurink, S. Knust: List scheduling in a parallel machine environment with precedence constraints and setup times
    OR Letters 29 (2001), 231-239.   DOI:10.1016/S0167-6377(01)00104-3

  25. P. Brucker, S. Knust: A linear programming and constraint propagation-based lower bound for the RCPSP
    European Journal of Operational Research 127 (2000), 355-362.   DOI:10.1016/S0377-2217(99)00489-0

  26. P. Brucker, S. Knust, D. Roper, Y. Zinder: Scheduling UET task systems with concurrency on two parallel identical processors
    Mathematical Methods of Operations Research 52 (2000), 369-387.   DOI:10.1007/s001860000089

  27. P. Brucker, S. Knust: Complexity results for single-machine problems with positive finish-start time-lags
    Computing 63 (1999), 299-316.   DOI:10.1007/s006070050036

  28. P. Brucker, S. Knust, A. Schoo, O. Thiele: A branch and bound algorithm for the resource-constrained project scheduling problem
    European Journal of Operational Research 107 (1998), 272-288.   DOI:10.1016/S0377-2217(97)00335-4

Books and Book Chapters

  1. P. Brucker, S. Knust: Complex Scheduling, 2nd edition, Springer, ISBN 978-3-642-23928-1, 2012. Web site   DOI:10.1007/978-3-642-23929-8

  2. P. Brucker, S. Knust: Complex Scheduling, Springer, ISBN 978-3-540-29545-7, 2006. Web site

  3. S. Knust: 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, 2011.   DOI:10.1007/978-3-642-15328-0_27

  4. S. Knust: "Diskret" optimierte Pläne im Alltag
    in: K. Wendland, A. Werner (eds.): Facettenreiche Mathematik - Einblicke in die moderne mathematische Forschung, Vieweg+Teubner, 257-272, 2011.

  5. P. Brucker, S. Knust: On the complexity of scheduling
    in: Y. Robert, F. Vivien (eds.): Introduction to Scheduling, Chapman and Hall/CRC Press. CRC Press, 1-21, 2009.

  6. S. Knust: 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, 2008.

  7. P. Brucker, S. Knust: 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.

  8. P. Brucker, S. Heitmann, S. Knust: 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, 2004.

  9. P. Brucker, S. Knust: 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, 2001.

  10. T. Baar, P. Brucker, S. Knust: 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, 1998.

  11. P. Brucker, S. Knust: Solving large-sized resource-constrained project scheduling problems
    in: J.Weglarz (ed.): Project Scheduling: Recent Models, Algorithms and Applications, Kluwer, 27-51, 1998.

Miscellaneous

Preprints

Last update: 04.01.2011 (SK)