EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Classification: MSC-90B35
Home Policy Brochure Browse Search User Area Contact Help

2011

Brueggemann, T. and Hurink, J.L. (2011) Matching based very large-scale neighborhoods for parallel machine scheduling. Journal of Heuristics, 17 (6). pp. 637-658. ISSN 1381-1231 *** ISI Impact 1,344 ***

2008

Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2008) Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines. In: 5th International Workshop on Approximation and Online Algorithms, October 11-12, 2007, Eilat, Israel. pp. 41-54. Lecture Notes in Computer Science 4927. Springer Verlag. ISSN 0302-9743 ISBN 978-3-540-77917-9
van Oostrum, J.M. and van Houdenhoven, M. and Hurink, J.L. and Hans, E.W. and Wullink, G. and Kazemier, G. (2008) A master surgical scheduling approach for cyclic scheduling in operating room departments. OR Spectrum, 30 (2). pp. 355-374. ISSN 0171-6468 *** ISI Impact 1,395 ***

2007

Grigoriev, A. and Sviridenko, M. and Uetz, M.J. (2007) Machine scheduling with resource dependent processing times. Mathematical Programming, 110 (1). pp. 209-228. ISSN 0025-5610 *** ISI Impact 2,062 ***

2006

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 1,395 ***
Brueggemann, T. and Hurink, J.L. (2006) Quality of Move-Optimal Schedules for Minimizing the Vector Norm of the Workloads. Memorandum 1808, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Brueggemann, T. and Hurink, J.L. and Kern, W. (2006) Quality of Move-optimal Schedules for Minimizing Total Weigted Completion Time. Operations research letters, 34 (5). pp. 583-590. ISSN 0167-6377 *** ISI Impact 0,627 ***
Brueggemann, T. and Hurink, J.L. and Vredeveld, T. and Woeginger, G.J. (2006) Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines. Memorandum 1801, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2005

Brueggemann, T. and Hurink, J.L. (2005) Matching based exponential neighborhoods for parallel machine scheduling. Memorandum 1773, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Brueggemann, T. and Hurink, J.L. (2005) Two exponential neighborhoods for single machine scheduling. Memorandum 1776, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Brueggemann, T. and Hurink, J.L. and Kern, W. (2005) Move-optimal schedules for parallel machines to minimize total weighted completion time. Memorandum 1748, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Ebben, M.J.R. and van der Heijden, M.C. and Hurink, J.L. and Schutten, J.M.J. (2005) Modeling of capacitated transportation systems for integral scheduling. In: Container Terminals and Automated Transport Systems. Springer Verlag, Berlin, pp. 287-306. ISBN 978-3-540-22328-3
Hurink, J.L. and Knust, S. (2005) Tabu search algorithms for job-shop problems with a single transport robot. European journal of operational research, 162 (1). pp. 99-111. ISSN 0377-2217 *** ISI Impact 2,679 ***
van Oostrum, J.M. and van Houdenhoven, M. and Hurink, J.L. and Hans, E.W. and Wullink, G. and Kazemier, G. (2005) A model for generating master surgical schedules to allow cyclic scheduling in operating room departments. Memorandum 1789, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Post, G.F. and Woeginger, G.J. (2005) Sports tournaments, home-away assignments, and the break minimization problem. Memorandum 1760, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2004

Ebben, M.J.R. and van der Heijden, M.C. and Hurink, J.L. and Schutten, J.M.J. (2004) Modeling of capacitated transportation systems for integral scheduling. OR Spectrum, 26 (2). pp. 263-282. ISSN 0171-6468 *** ISI Impact 1,395 ***
Post, G.F. and Ruizenaar, H.W.A. (2004)
Clusterschemes in Dutch secondary schools.
Memorandum 1707, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2003

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 1,395 ***
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,627 ***
Brucker, P. and Hurink, J.L. and Knust, S. (2003) A polynomial algorithm for $P | p_j = 1, r_j, outtree | \Sigma C_j$. Mathematical methods of operations research, 56 (3). pp. 407-412. ISSN 1432-2994 *** ISI Impact 0,526 ***
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,219 ***
Ebben, M.J.R. and van der Heijden, M.C. and Hurink, J.L. and Schutten, J.M.J. (2003)
Modeling of capacitated transportation systems for integral scheduling.
Memorandum 1669, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2002

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
Hurink, J.L. and Knust, S. (2002) A tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete applied mathematics, 119 (1-2). pp. 181-203. ISSN 0166-218X *** ISI Impact 0,722 ***

2001

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 $P | p_j = 1, r_j, outtree | \Sigma C_j$ and $P | p_j = 1,r_j, outtree, pmtn | \Sigma C_j$. Memorandum 1566, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Hurink, J.L. and Keuchel, J. (2001) Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. Discrete Applied Mathematics, 112 (1-3). pp. 179-197. ISSN 0166-218X *** ISI Impact 0,722 ***
Hurink, J.L. and Knust, S. (2001)
Tabu search algorithms for job-shop problems with a single transport robot.
Memorandum 1579, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Hurink, J.L. and Knust, S. (2001) List scheduling in a parallel machine environment with precedence constraints and setup times. Operations Research Letters, 29 (5). pp. 231-239. ISSN 0167-6377 *** ISI Impact 0,627 ***
Hurink, J.L. and Knust, S. (2001) Makespan minimization for flow-shop problems with transportation times and a single robot. Discrete Applied Mathematics, 112 (1-3). pp. 199-216. ISSN 0166-218X *** ISI Impact 0,722 ***
Kuijpers, C.M.H. (2001)
Cyclic machine scheduling with tool transportation - additional calculations.
Memorandum 1580, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

2000

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 1,406 ***
Hurink, J.L. and Kern, W. and Nawijn, W.M. (2000) Scheduling split-jobs on parallel machines. Memorandum 1530, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Hurink, J.L. and Knust, S. (2000)
List scheduling in a parallel machine environment with precedence constraints and setup times.
Memorandum 1525, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

1999

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,722 ***
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 Rolfes, T. (1999)
Routing of railway carriages: A case study.
Memorandum 1498, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Hurink, J.L. (1999) An exponential neighbourhood for a one-machine batching problem. OR Spektrum, 21 (4). pp. 461-476. ISSN 0171-6468 *** ISI Impact 1,395 ***
Hurink, J.L. and Knust, S. (1999)
A tabu search algorithm for scheduling a single robot in a job-shop environment.
Memorandum 1496, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690

1998

Hurink, J.L. (1998)
An exponential neighbourhood for a one-machine batching problem.
Memorandum 1449, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690
Hurink, J.L. and Keuchel, J. (1998)
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags.
Memorandum 1440, Department of Applied Mathematics, University of Twente, Enschede. ISSN 0169-2690