팔로우
Han Hoogeveen
Han Hoogeveen
uu.nl의 이메일 확인됨
제목
인용
인용
연도
Scheduling a batching machine
P Brucker, A Gladky, H Hoogeveen, MY Kovalyov, CN Potts, ...
Journal of scheduling 1 (1), 31-54, 1998
6011998
Multicriteria scheduling
H Hoogeveen
European Journal of operational research 167 (3), 592-623, 2005
5322005
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
3261996
Short shop schedules
DP Williamson, LA Hall, JA Hoogeveen, CAJ Hurkens, JK Lenstra, ...
Operations Research 45 (2), 288-294, 1997
3061997
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
JA Hoogeveen
Operations Research Letters 10 (5), 291-295, 1991
2601991
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
2191994
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
2122000
Parallel machine scheduling by column generation
JM van Den Akker, JA Hoogeveen, SL van de Velde
Operations research 47 (6), 862-872, 1999
2091999
Scheduling around a small common due date
JA Hoogeveen, SL Van de Velde
European Journal of Operational Research 55 (2), 237-242, 1991
1841991
Optimal on-line algorithms for single-machine scheduling
JA Hoogeveen, APA Vestjens
Integer Programming and Combinatorial Optimization: 5th International IPCO …, 1996
1771996
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, 333-348, 2004
1702004
Seven criteria for integer sequences being graphic
G Sierksma, H Hoogeveen
Journal of Graph theory 15 (2), 223-231, 1991
1621991
Non-approximability results for scheduling problems with minsum criteria
H Hoogeveen, P Schuurman, GJ Woeginger
INFORMS Journal on Computing 13 (2), 157-168, 2001
1502001
Preemptive scheduling with rejection
H Hoogeveen, M Skutella, GJ Woeginger
Mathematical Programming 94, 361-374, 2003
1452003
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
1261994
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
1191995
Scheduling electric vehicles
ME van Kooten Niekerk, JM Van den Akker, JA Hoogeveen
Public Transport 9, 155-176, 2017
1022017
Minimizing maximum promptness and maximum lateness on a single machine
JA Hoogeveen
Mathematics of Operations Research 21 (1), 100-114, 1996
96*1996
Single-machine bicriteria scheduling
JA Hoogeveen
941992
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems
JA Hoogeveen, SL Van de Velde
Mathematical Programming 70, 173-190, 1995
891995
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20