EEMCS

Brucker, P. and Heitmann, S. and Hurink, J.L. and Nieberg, T. (2006) Job-Shop Scheduling with Limited Capacity Buffers. OR Spectrum, 28 (2). pp. 151-176. ISSN 0171-6468 *** ISI Impact 2,030 ***

Brucker, P. and Heitmann, S. and Hurink, J.L. (2003) Flow-Shop Problems with Intermediate Buffers. OR Spectrum, 25 (4). pp. 549-574. ISSN 0171-6468 *** ISI Impact 2,030 ***

Brucker, P. and Heitmann, S. and Hurink, J.L. (2003) How useful are preemptive schedules? Operations research letters, 31 (2). pp. 129-136. ISSN 0167-6377 *** ISI Impact 0,739 ***

Brucker, P. and Hurink, J.L. and Knust, S. (2003) A polynomial algorithm for . Mathematical methods of operations research, 56 (3). pp. 407-412. ISSN 1432-2994 *** ISI Impact 0,848 ***

Brucker, P. and Hurink, J.L. and Rolfes, T. (2003) Routing of railway carriages. Journal of Global Optimization, 27 (2-3). pp. 313-332. ISSN 0925-5001 *** ISI Impact 1,160 ***

Brucker, P. and Heitmann, S. and Hurink, J.L. (2002)
Flow-shop problems with intermediate buffers. Memorandum 1625, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Brucker, P. and Heitmann, S. and Hurink, J.L. (2001)
How useful are preemptive schedules? Memorandum 1605, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Brucker, P. and Hurink, J.L. and Knust, S. (2001) A polynomial algorithm for and . Memorandum 1566, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Brucker, P. and Hurink, J.L. (2000) Solving a chemical batch scheduling problem by local search. Annals of Operations Research, 96 (1-4). pp. 17-38. ISSN 0254-5330 *** ISI Impact 0,675 ***

Brucker, P. and Hilbig, T. and Hurink, J.L. (1999) A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 94 (1-3). pp. 77-99. ISSN 0166-218X *** ISI Impact 0,822 ***

Brucker, P. and Hurink, J.L. (1999)
Solving a chemical batch scheduling problem by local search. Memorandum 1506, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Brucker, P. and Hurink, J.L. and Kubiak, W. (1999) Scheduling identical jobs with chain precedence constraints on two uniform machines. Mathematical Methods of Operations Research, 49 (2). pp. 211-219. ISSN 1432-2994 *** ISI Impact 0,848 ***

Brucker, P. and Hurink, J.L. and Rolfes, T. (1999)
Routing of railway carriages: A case study. Memorandum 1498, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

Brucker, P. and Hurink, J.L. and Jurisch, B. and Wöstmann, B. (1997) A Branch and Bound Method for the Open Shop Problem. Discrete Applied Mathematics, 76 (1-3). pp. 43-59. ISSN 0166-218X *** ISI Impact 0,822 ***

Brucker, P. and Hurink, J.L. and Werner, F. (1997) Improving local search heuristics for some scheduling problems. Part II. Discrete Applied Mathematics, 72 (1-2). pp. 47-69. ISSN 0166-218X *** ISI Impact 0,822 ***

Brucker, P. and Hurink, J.L. (1996) Complex Sequencing Problems and Local Search Heuristics. In: Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, Dordrecht, pp. 151-166. ISBN 0792397002

Brucker, P. and Hurink, J.L. and Werner, F. (1996) Improving local search heuristics for some scheduling problems -- I. Discrete Applied Mathematics, 65 (1-3). pp. 97-122. ISSN 0166-218X *** ISI Impact 0,822 ***

Brucker, P. and Burkard, R. and Hurink, J.L. (1990) Cyclic schedules for r irregularly occurring event. Journal of Computational and Applied Mathematics, 30 (2). pp. 173-189. ISSN 0377-0427 *** ISI Impact 1,029 ***

Brucker, P. and Hurink, J.L. (1986) A railway scheduling problem. ZOR Zeitschrift fur Operations Research, 30 (5). pp. 223-227. ISSN 0340-9422