Han Hoogeveen
Han Hoogeveen
E-mail confirmado em uu.nl
Título
Citado por
Citado por
Ano
Scheduling a batching machine
P Brucker, A Gladky, H Hoogeveen, MY Kovalyov, CN Potts, ...
Journal of scheduling 1 (1), 31-54, 1998
5161998
Multicriteria scheduling
H Hoogeveen
European Journal of operational research 167 (3), 592-623, 2005
4292005
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
JA Hoogeveen, JK Lenstra, B Veltman
European Journal of Operational Research 89 (1), 172-175, 1996
276*1996
Short shop schedules
DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ...
Operations Research 45 (2), 288-294, 1997
2591997
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
JA Hoogeveen
Operations Research Letters 10 (5), 291-295, 1991
2051991
Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
WHM Raaymakers, JA Hoogeveen
European Journal of Operational Research 126 (1), 131-151, 2000
1912000
Complexity of scheduling multiprocessor tasks with prespecified processor allocations
JA Hoogeveen, SL van de Velde, B Veltman
Discrete Applied Mathematics 55 (3), 259-272, 1994
1901994
Scheduling around a small common due date
JA Hoogeveen, SL Van de Velde
European Journal of Operational Research 55 (2), 237-242, 1991
1721991
Parallel machine scheduling by column generation
JM van Den Akker, JA Hoogeveen, SL van de Velde
Operations Research 47 (6), 862-872, 1999
1691999
Optimal on-line algorithms for single-machine scheduling
JA Hoogeveen, APA Vestjens
International Conference on Integer Programming and Combinatorial …, 1996
1351996
Non-approximability results for scheduling problems with minsum criteria
H Hoogeveen, P Schuurman, GJ Woeginger
INFORMS Journal on Computing 13 (2), 157-168, 2001
1322001
Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
W Yu, H Hoogeveen, JK Lenstra
Journal of Scheduling 7 (5), 333-348, 2004
1262004
Preemptive scheduling with rejection
H Hoogeveen, M Skutella, GJ Woeginger
Mathematical Programming 94 (2-3), 361-374, 2003
1252003
Seven criteria for integer sequences being graphic
G Sierksma, H Hoogeveen
Journal of Graph theory 15 (2), 223-231, 1991
1221991
Three, four, five, six, or the complexity of scheduling with communication delays
JA Hoogeveen, JK Lenstra, B Veltman
Operations Research Letters 16 (3), 129-137, 1994
1011994
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
JA Hoogeveen, SL van de Velde
Operations Research Letters 17 (5), 205-208, 1995
931995
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems
JA Hoogeveen, SL Van de Velde
Mathematical Programming 70 (1-3), 173-190, 1995
851995
Single-machine bicriteria scheduling
JA Hoogeveen
CWI, 1992
831992
Minimizing total completion time in a two-machine flowshop: analysis of special cases
JA Hoogeveen, T Kawaguchi
Mathematics of Operations Research 24 (4), 887-910, 1999
801999
A branch-and-bound algorithm for single-machine earliness–tardiness scheduling with idle time
JA Hoogeveen, SL van de Velde
INFORMS Journal on Computing 8 (4), 402-412, 1996
771996
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20