HHHan Hoogeveen
Han Hoogeveen
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Han Hoogeveen has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Marjan van Den Akker
Utrecht University
3 shared publications - Gerhard J. Woeginger
Department of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
2 shared publications - Guido Diepen
Paragon Decision Technology
1 shared publication - J. W. van Kempen
Pricing and Revenue Management (AMS/RX)
1 shared publication Jan Karel Lenstra
1 shared publication- Linda van Norden
Delft University of Technology
1 shared publication
Latest Publications
- 11 August 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 15 (6) , 801-810
Using column generation to solve parallel machine scheduling problems with minmax objective functions
- 11 August 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 15 (6) , 801-810
Using column generation to solve parallel machine scheduling problems with minmax objective functions
- 1 May 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 13 (6) , 561-576
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- 1 May 2010
- Published by Springer Nature in Journal of Scheduling
- Vol. 13 (6) , 561-576
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Open Access
- 21 September 2007
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (1) , 59-69
Minimizing the number of late jobs in a stochastic setting using a chance constraint
- 21 September 2007
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (1) , 59-69
Open AccessMinimizing the number of late jobs in a stochastic setting using a chance constraint
- 1 December 2006
- Published by Springer Nature in Journal of Scheduling
- Vol. 9 (6) , 559-568
Lower bounds for minimizing total completion time in a two-machine flow shop
- 1 December 2006
- Published by Springer Nature in Journal of Scheduling
- Vol. 9 (6) , 559-568
Lower bounds for minimizing total completion time in a two-machine flow shop
- 1 September 2004
- Published by Springer Nature in Journal of Scheduling
- Vol. 7 (5) , 333-348
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard
- 1 September 2004
- Published by Springer Nature in Journal of Scheduling
- Vol. 7 (5) , 333-348
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard
- 1 January 2003
- Published by Springer Nature in Mathematical Programming
- Vol. 94 (2-3) , 361-374
Preemptive scheduling with rejection
- 1 January 2003
- Published by Springer Nature in Mathematical Programming
- Vol. 94 (2-3) , 361-374
Preemptive scheduling with rejection
- 31 December 2001
- Published by Elsevier in Operations Research Letters
- Vol. 29 (5) , 241-245
A very difficult scheduling problem with communication delays
- 31 December 2001
- Published by Elsevier in Operations Research Letters
- Vol. 29 (5) , 241-245
A very difficult scheduling problem with communication delays
- 1 November 2000
- Published by Wiley in Journal of Scheduling
- Vol. 3 (6) , 333-341
Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- 1 November 2000
- Published by Wiley in Journal of Scheduling
- Vol. 3 (6) , 333-341
Restarts can help in the on-line minimization of the maximum delivery time on a single machine