Sigrid Knust Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2008
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSigrid Knust: Turnier- und Sportligaplanung. Taschenbuch der Algorithmen 2008: 275-284
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSigrid Knust: Scheduling sports tournaments on a single court minimizing waiting times. Oper. Res. Lett. 36(4): 471-476 (2008)
2006
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSigrid Knust, Michael von Thaden: Balanced home-away assignments. Discrete Optimization 3(4): 354-365 (2006)
2005
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohann Hurink, Sigrid Knust: Tabu search algorithms for job-shop problems with a single transport robot. European Journal of Operational Research 162(1): 99-111 (2005)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust, Guoqing Wang: Complexity results for flow-shop problems with a single server. European Journal of Operational Research 165(2): 398-407 (2005)
2004
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPhilippe Baptiste, Peter Brucker, Sigrid Knust, Vadim G. Timkovsky: Ten notes on equal-processing-time scheduling. 4OR 2(2): 111-127 (2004)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust, T. C. Edwin Cheng, Natalia V. Shakhlevich: Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays. Annals OR 129(1-4): 81-106 (2004)
2003
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust: Sequencing and scheduling. European Journal of Operational Research 149(2): 247-248 (2003)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust: Lower bounds for resource-constrained project scheduling problems. European Journal of Operational Research 149(2): 302-313 (2003)
2002
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust: Lower Bounds for Scheduling a Single Robot in a Job-Shop Environment. Annals OR 115(1-4): 147-172 (2002)
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohann Hurink, Sigrid Knust: A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Applied Mathematics 119(1-2): 181-203 (2002)
2001
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohann Hurink, Sigrid Knust: Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics 112(1-3): 199-216 (2001)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohann 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust: Resource-Constrained Project Scheduling and Timetabling. PATAT 2000: 277-293
1999
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Brucker, Sigrid Knust: Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. Computing 63(4): 299-316 (1999)

Coauthor Index

1Philippe Baptiste [10]
2Peter Brucker [1] [2] [6] [7] [8] [9] [10] [11]
3T. C. Edwin Cheng [9]
4Johann Hurink [3] [4] [5] [12]
5Natalia V. Shakhlevich [9]
6Michael von Thaden [13]
7Vadim G. Timkovsky [10]
8Guoqing Wang [11]

Colors in the list of coauthors

Copyright © Fri Dec 4 16:04:45 2009 by Michael Ley (ley@uni-trier.de)