J. A. Hoogeveen
List of publications from the
| * | 2009 |
|---|
| 34 | EE | Guido Diepen,
J. M. van den Akker,
J. A. Hoogeveen:
Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol.
Robust and Online Large-Scale Optimization 2009: 338-353 |
| 2008 |
|---|
| 33 | EE | Guido Diepen,
Marjan van den Akker,
Han Hoogeveen:
Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol.
ATMOS 2008 |
| 32 | EE | Marjan van den Akker,
Han Hoogeveen:
Minimizing the number of late jobs in a stochastic setting using a chance constraint.
J. Scheduling 11(1): 59-69 (2008) |
| 2007 |
|---|
| 31 | EE | J. M. van den Akker,
Guido Diepen,
J. A. Hoogeveen:
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.
CPAIOR 2007: 376-390 |
| 2006 |
|---|
| 30 | EE | Marjan van den Akker,
J. A. Hoogeveen,
Jules W. van Kempen:
Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions.
ESA 2006: 648-659 |
| 29 | EE | Han Hoogeveen,
Linda van Norden,
Steef L. van de Velde:
Lower bounds for minimizing total completion time in a two-machine flow shop.
J. Scheduling 9(6): 559-568 (2006) |
| 28 | EE | T. C. Edwin Cheng,
Yong He,
Han Hoogeveen,
Min Ji,
Gerhard J. Woeginger:
Scheduling with step-improving processing times.
Oper. Res. Lett. 34(1): 37-40 (2006) |
| 2005 |
|---|
| 27 | EE | Han Hoogeveen,
Marjan van den Akker:
Getting rid of stochasticity: applicable sometimes.
Algorithms for Optimization with Incomplete Information 2005 |
| 26 | EE | Han Hoogeveen:
Multicriteria scheduling.
European Journal of Operational Research 167(3): 592-623 (2005) |
| 25 | EE | Ann Vandevelde,
Han Hoogeveen,
Cor A. J. Hurkens,
Jan Karel Lenstra:
Lower Bounds for the Head-Body-Tail Problem on Parallel Machines: A Computational Study of the Multiprocessor Flow Shop.
INFORMS Journal on Computing 17(3): 305-320 (2005) |
| 2004 |
|---|
| 24 | EE | Han Hoogeveen:
Book Review.
J. Scheduling 7(1): 93-94 (2004) |
| 23 | EE | Wenci Yu,
Han Hoogeveen,
Jan Karel Lenstra:
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.
J. Scheduling 7(5): 333-348 (2004) |
| 2003 |
|---|
| 22 | EE | Marjan van den Akker,
Han Hoogeveen,
Gerhard J. Woeginger:
The two-machine open shop problem: To fit or not to fit, that is the question.
Oper. Res. Lett. 31(3): 219-224 (2003) |
| 21 | EE | Sixiang Hou,
Han Hoogeveen:
The three-machine proportionate flow shop problem with unequal machine speeds.
Oper. Res. Lett. 31(3): 225-231 (2003) |
| 2002 |
|---|
| 20 | EE | Han Hoogeveen,
Gerhard J. Woeginger:
Some Comments on Sequencing with Controllable Processing Times.
Computing 68(2): 181-192 (2002) |
| 19 | EE | Marjan van den Akker,
Han Hoogeveen,
Steef L. van de Velde:
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem.
INFORMS Journal on Computing 14(1): 37-51 (2002) |
| 2001 |
|---|
| 18 | EE | Han Hoogeveen,
Petra Schuurman,
Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria.
INFORMS Journal on Computing 13(2): 157-168 (2001) |
| 17 | EE | Han Hoogeveen,
Gerhard J. Woeginger:
A very difficult scheduling problem with communication delays.
Oper. Res. Lett. 29(5): 241-245 (2001) |
| 2000 |
|---|
| 16 | EE | Han Hoogeveen,
Martin Skutella,
Gerhard J. Woeginger:
Preemptive Scheduling with Rejection.
ESA 2000: 268-277 |
| 15 | EE | Marjan van den Akker,
Han Hoogeveen,
Nodari Vakhania:
Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine.
ESA 2000: 427-436 |
| 14 | EE | Han Hoogeveen,
Chris N. Potts,
Gerhard J. Woeginger:
On-line scheduling on a single machine: maximizing the number of early jobs.
Oper. Res. Lett. 27(5): 193-197 (2000) |
| 13 | EE | Han Hoogeveen,
Arjen P. A. Vestjens:
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine.
SIAM J. Discrete Math. 13(1): 56-63 (2000) |
| 1998 |
|---|
| 12 | EE | Han Hoogeveen,
Petra Schuurman,
Gerhard J. Woeginger:
Non-approximability Results for Scheduling Problems with Minsum Criteria.
IPCO 1998: 353-366 |
| 11 | | Han Hoogeveen,
Steef L. van de Velde:
Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.
Math. Program. 82: 273-289 (1998) |
| 1997 |
|---|
| 10 | EE | Han Hoogeveen,
Steef L. van de Velde:
Earliness-Tardiness Scheduling Around Almost Equal Due Dates.
INFORMS Journal on Computing 9(1): 92-99 (1997) |
| 1996 |
|---|
| 9 | EE | Han Hoogeveen,
Tsuyoshi Kawaguchi:
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases.
IPCO 1996: 374-388 |
| 8 | EE | Han Hoogeveen,
Arjen P. A. Vestjens:
Optimal On-Line Algorithms for Single-Machine Scheduling.
IPCO 1996: 404-414 |
| 7 | EE | J. A. Hoogeveen,
Steef L. van de Velde:
A Branch-and-Bound Algorithm for Single-Machine Earliness-Tardiness Scheduling with Idle Time.
INFORMS Journal on Computing 8(4): 402-412 (1996) |
| 6 | | Han Hoogeveen:
Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria.
J. Algorithms 21(2): 415-433 (1996) |
| 1995 |
|---|
| 5 | EE | Han Hoogeveen,
Steef L. van de Velde:
Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times.
IPCO 1995: 292-306 |
| 1994 |
|---|
| 4 | EE | J. A. Hoogeveen,
Steef L. van de Velde,
Bart Veltman:
Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations.
Discrete Applied Mathematics 55(3): 259-272 (1994) |
| 1993 |
|---|
| 3 | | J. A. Hoogeveen,
Steef L. van de Velde:
Stronger Lagrangian bounds by use of slack variables: applications to machine scheduling problems.
IPCO 1993: 195-208 |
| 1992 |
|---|
| 2 | | J. A. Hoogeveen,
H. Oosterhout,
Steef L. van de Velde:
New Lower and Upper Bounds for Scheduling Around a Small Common Due Date.
IPCO 1992: 122-135 |
| 1990 |
|---|
| 1 | | J. A. Hoogeveen:
Minimizing Maximum Earliness and Maximum Lateness on a Single Machine.
IPCO 1990: 283-295 |
