Browsing by Author Brucker, P


Or, select a letter below to browse by last name
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
Showing results 1 to 20 of 39  next >
Issue DateTitleAuthor(s)
1997A branch & bound algorithm for the open-shop problemBrucker, P; Hurink, J; Jurisch, B; Wostmann, B
1996A branch & bound method for the general-shop problem with sequence dependent setup-timesBrucker, P; Thiele, O
1999A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lagsBrucker, P; Hilbig, T; Hurink, J
1998A branch and bound algorithm for the resource-constrained project scheduling problemBrucker, P; Knust, S ; Schoo, A; Thiele, O
2000A linear programming and constraint propagation-based lower bound for the RCPSPBrucker, P; Knust, S 
2003A polynomial algorithm for P vertical bar p(j)=1, r(j), outtree vertical bar Sigma C-jBrucker, P; Hurink, J; Knust, S 
1998Batch scheduling with deadlines on parallel machinesBrucker, P; Kovalyov, MY; Shafransky, YM; Werner, F
1997Complexity of scheduling problems with multi-purpose machinesBrucker, P; Jurisch, B; Kramer, A
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 
2000Editors' prefaceBrucker, P; Drexl, A; Mohring, RH; Neumann, E; Pesch, E
2002Fast algorithms with algebraic monge propertiesBein, WW; Brucker, P; Larmore, LL; Park, JK
2003Flow-shop problems with intermediate buffersBrucker, P; Heitmann, S; Hurink, J
2003How useful are preemptive schedules?Brucker, P; Heitmann, S; Hurink, J
1996Improving local search heuristics for some scheduling problems .1.Brucker, P; Hurink, J; Werner, F
1997Improving local search heuristics for some scheduling problems .2.Brucker, P; Hurink, J; Werner, F
2006Job-shop scheduling with limited capacity buffersBrucker, P; Heitmann, S; Hurink, J; Nieberg, T
2003Lower bounds for resource-constrained project scheduling problemsBrucker, P; Knust, S