The SCEAS System
| |||||||

## Search the dblp DataBase
Han Hoogeveen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Han Hoogeveen, Marjan van den Akker
**Getting rid of stochasticity: applicable sometimes.**[Citation Graph (0, 0)][DBLP] Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:427-436 [Conf] - Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger
**Preemptive Scheduling with Rejection.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:268-277 [Conf] - Han Hoogeveen, Tsuyoshi Kawaguchi
**Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases.**[Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:374-388 [Conf] - Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
**Non-approximability Results for Scheduling Problems with Minsum Criteria.**[Citation Graph (0, 0)][DBLP] IPCO, 1998, pp:353-366 [Conf] - Han Hoogeveen, Steef L. van de Velde
**Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times.**[Citation Graph (0, 0)][DBLP] IPCO, 1995, pp:292-306 [Conf] - Han Hoogeveen, Arjen P. A. Vestjens
**Optimal On-Line Algorithms for Single-Machine Scheduling.**[Citation Graph (0, 0)][DBLP] IPCO, 1996, pp:404-414 [Conf] - Han Hoogeveen, Gerhard J. Woeginger
**Some Comments on Sequencing with Controllable Processing Times.**[Citation Graph (0, 0)][DBLP] Computing, 2002, v:68, n:2, pp:181-192 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2002, v:14, n:1, pp:37-51 [Journal] - Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
**Non-Approximability Results for Scheduling Problems with Minsum Criteria.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2001, v:13, n:2, pp:157-168 [Journal] - Han Hoogeveen, Steef L. van de Velde
**Earliness-Tardiness Scheduling Around Almost Equal Due Dates.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 1997, v:9, n:1, pp:92-99 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 2005, v:17, n:3, pp:305-320 [Journal] - Han Hoogeveen
**Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1996, v:21, n:2, pp:415-433 [Journal] - Han Hoogeveen, Steef L. van de Velde
**Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine.**[Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:82, n:, pp:273-289 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:219-224 [Journal] - T. C. Edwin Cheng, Yong He, Han Hoogeveen, Min Ji, Gerhard J. Woeginger
**Scheduling with step-improving processing times.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2006, v:34, n:1, pp:37-40 [Journal] - Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger
**On-line scheduling on a single machine: maximizing the number of early jobs.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2000, v:27, n:5, pp:193-197 [Journal] - Han Hoogeveen, Gerhard J. Woeginger
**A very difficult scheduling problem with communication delays.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2001, v:29, n:5, pp:241-245 [Journal] - Sixiang Hou, Han Hoogeveen
**The three-machine proportionate flow shop problem with unequal machine speeds.**[Citation Graph (0, 0)][DBLP] Oper. Res. Lett., 2003, v:31, n:3, pp:225-231 [Journal] - Han Hoogeveen, Linda van Norden, Steef L. van de Velde
**Lower bounds for minimizing total completion time in a two-machine flow shop.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2006, v:9, n:6, pp:559-568 [Journal] - Wenci Yu, Han Hoogeveen, Jan Karel Lenstra
**Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:5, pp:333-348 [Journal] - Han Hoogeveen
**Book Review.**[Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:1, pp:93-94 [Journal] - Han Hoogeveen, Arjen P. A. Vestjens
**A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2000, v:13, n:1, pp:56-63 [Journal] - Han Hoogeveen
**Multicriteria scheduling.**[Citation Graph (0, 0)][DBLP] European Journal of Operational Research, 2005, v:167, n:3, pp:592-623 [Journal] **Integrated Gate and Bus Assignment at Amsterdam Airport Schiphol.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |